|
Search: id:A080468
|
|
| |
|
| 0, 1, 0, 1, 2, 1, 0, 1, 2, 1, 2, 3, 2, 1, 0, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 3, 4, 3, 2, 1, 0, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 3, 4, 3, 2, 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 3, 4, 5, 4, 3, 2, 1, 0, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 3, 4, 3, 2, 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 3, 4, 5, 4, 3, 2, 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 3, 4
(list; graph; listen)
|
|
|
OFFSET
|
2,5
|
|
|
COMMENT
|
Terms between 2^n and 2^(n+1) as n goes to infinity tend to the sequence : 0,1,2,1,2,3,2,1,2,3,2,3,4,3,2,1,2,3,2,3,4,3,2,3,4,3,4,5,4,3,2,1,....
|
|
FORMULA
|
a(2^n)=0; sum(k=2^n, 2^(n+1), a(k))=n*2^(n-1)= A001787(n)
|
|
CROSSREFS
|
Cf. A045412, A055938.
Sequence in context: A038698 A087991 A076092 this_sequence A080940 A080941 A114021
Adjacent sequences: A080465 A080466 A080467 this_sequence A080469 A080470 A080471
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 12 2003
|
|
|
Search completed in 0.002 seconds
|
