|
Search: id:A010062
|
|
|
| A010062 |
|
a(n+1) = a(n) + number of 1's in binary representation of a(n). |
|
+0
3
|
|
| 1, 2, 3, 5, 7, 10, 12, 14, 17, 19, 22, 25, 28, 31, 36, 38, 41, 44, 47, 52, 55, 60, 64, 65, 67, 70, 73, 76, 79, 84, 87, 92, 96, 98, 101, 105, 109, 114, 118, 123, 129, 131, 134, 137, 140, 143, 148, 151, 156, 160, 162, 165, 169, 173, 178, 182, 187, 193, 196, 199, 204
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n) = A092391(a(n)) = a(n) + A000120(a(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 08 2004
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 0..10000 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 01 2009]
|
|
PROGRAM
|
(PARI) s=1; for(n=1, 100, s=s+sum(i=1, length(binary(s)), component(binary(s), i)); print1(s, ", "))
|
|
CROSSREFS
|
Sequence in context: A117286 A144726 A123885 this_sequence A119565 A119592 A087539
Adjacent sequences: A010059 A010060 A010061 this_sequence A010063 A010064 A010065
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Leonid Broukhis (leo(AT)mailcom.com)
|
|
EXTENSIONS
|
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 02 2002
|
|
|
Search completed in 0.002 seconds
|
