login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023691 Numbers with exactly 9 ones in binary expansion. 14
511, 767, 895, 959, 991, 1007, 1015, 1019, 1021, 1022, 1279, 1407, 1471, 1503, 1519, 1527, 1531, 1533, 1534, 1663, 1727, 1759, 1775, 1783, 1787, 1789, 1790, 1855, 1887, 1903, 1911, 1915, 1917, 1918, 1951, 1967, 1975 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Ivan Neretin, Table of n, a(n) for n = 1..10000

FORMULA

a(n+1)=A057168(a(n)). - M. F. Hasler, Aug 27 2014

MATHEMATICA

Select[ Range[ 511, 2048 ], (Count[ IntegerDigits[ #, 2 ], 1 ]==9)& ]

PROG

(PARI) is_A023691(n)=hammingweight(n)==9 \\ M. F. Hasler, Aug 27 2014

(PARI) print1(t=2^9-1); for(i=2, 50, print1(", "t=A057168(t))) \\ M. F. Hasler, Aug 27 2014

CROSSREFS

Cf. A000079, A018900, A014311, A014312, A014313, A023688, A023689, A023690 (Hamming weight = 1, 2, ..., 8), A057168.

Sequence in context: A051985 A103206 A277172 * A045118 A043451 A158011

Adjacent sequences:  A023688 A023689 A023690 * A023692 A023693 A023694

KEYWORD

nonn,base,easy

AUTHOR

Olivier Gérard

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 14:12 EST 2019. Contains 319225 sequences. (Running on oeis4.)