Odious

A000069

the number of first <code>n</code> entries from the sequence.

a logical; <code>TRUE</code> to use large number representation, <code>FALSE</code> otherwise.

Under OEIS <a href="https://oeis.org/A000069">A000069</a>, an Odious number has an odd number of 1's in its binary expansion.
First 6 Odious numbers are 	1, 2, 4, 7, 8, 11.

Generates well-known integer sequences. 'gmp' package is adopted for computing with arbitrarily large numbers. Every function has hyperlink to its corresponding item in OEIS (The On-Line Encyclopedia of Integer Sequences) in the function help page. For interested readers, see Sloane and Plouffe (1995, ISBN:978-0125586306).

Kisung You

Zseq

Integer Sequence Generator

Odious function

<dl><dt>n</dt>
<dd>the number of first <code>n</code> entries from the sequence.</dd>
<dt>gmp</dt>
<dd>a logical; <code>TRUE</code> to use large number representation, <code>FALSE</code> otherwise.</dd></dl>

Arguments

Under OEIS <a href='https://oeis.org/A000069'>A000069</a>, an Odious number has an odd number of 1's in its binary expansion.
First 6 Odious numbers are 	1, 2, 4, 7, 8, 11.

Odious numbers — Odious

<dl>

<dt>n</dt>
<dd>the number of first <code>n</code> entries from the sequence.</dd>


<dt>gmp</dt>
<dd>a logical; <code>TRUE</code> to use large number representation, <code>FALSE</code> otherwise.</dd>

</dl>

Odious: Odious numbers

Description

Usage

Value

Arguments

See Also

Examples