|
Search: id:A063787
|
|
|
| A063787 |
|
a(2^k) = k + 1 and a(2^k + i) = 1 + a(i) for k >= 0 and 0 < i < 2^k. |
|
+0
6
|
|
| 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 3, 4, 4, 5, 4, 5, 5, 6, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Equals log(A131136)/log(2) - Stephen Crowley (crow(AT)crowlogic.net), Aug 25 2008
a(n) = A007814(n) + A000120(n) [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 04 2009]
|
|
LINKS
|
Michael Gilleland, Some Self-Similar Integer Sequences
|
|
EXAMPLE
|
k = 3: a(2^3) = a(8) = 4 = 3 + 1; k = 3, i = 5: a(2^3 + 5) = a(13) = 3 = 1 + 2 = 1 + a(5).
Contribution from Omar E. Pol (info(AT)polprimos.com), Jun 12 2009: (Start)
Triangle begins:
1;
2,2;
3,2,3,3;
4,2,3,3,4,3,4,4;
5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5;
6,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6;
7,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,3,4,4,5,...
(End)
|
|
CROSSREFS
|
Equals A000120(n-1)+1.
Cf. A131136.
A007814 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 04 2009]
Cf. A000079. [From Omar E. Pol (info(AT)polprimos.com), Jun 12 2009]
Adjacent sequences: A063784 A063785 A063786 this_sequence A063788 A063789 A063790
Sequence in context: A057941 A126071 A105264 this_sequence A129843 A050430 A071330
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 16 2001
|
|
|
Search completed in 0.002 seconds
|
