|
Search: id:A131813
|
|
|
| A131813 |
|
a(n+1) = number of preceding terms that are contained in a(n) in binary; a(0)=0. |
|
+0
3
|
|
| 0, 1, 1, 2, 4, 5, 5, 6, 5, 7, 3, 3, 4, 6, 8, 7, 6, 9, 7, 7, 8, 8, 9, 8, 10, 8, 11, 10, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 9, 11, 13, 15, 10, 12, 14, 16, 12, 15, 11, 14, 17, 12, 16, 13, 16, 14, 18, 12, 17, 13, 17, 14, 19, 14, 20, 15, 12, 18, 13, 18, 14, 21, 13, 19, 15, 13
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
a(n+1) = #{k: a(k) substring of a(n) in binary representation, 0<=k<=n}.
a(A131814(n)) = n and a(m) <> n for m<A131814(n).
This is an interesting sequence to listen to. - njas, Sep 28 2007
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 0..25000
Index entries for sequences related to binary expansion of n
|
|
EXAMPLE
|
a(8) = #{a(0), a(1), a(2), a(3), a(7)} = 5;
a(9) = #{a(0), a(1), a(2), a(3), a(5), a(6), a(8)} = 7;
a(10) = #{a(1), a(2), a(9)} = 3.
|
|
CROSSREFS
|
Cf. A007088, A137655.
Sequence in context: A004581 A070784 A034214 this_sequence A083038 A061008 A091988
Adjacent sequences: A131810 A131811 A131812 this_sequence A131814 A131815 A131816
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 18 2007, Feb 01 2008
|
|
|
Search completed in 0.002 seconds
|
