| 0, 1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 21, 22, 23, 26, 27, 29, 30, 31, 42, 43, 45, 46, 47, 53, 54, 55, 58, 59, 61, 62, 63, 85, 86, 87, 90, 91, 93, 94, 95, 106, 107, 109, 110, 111, 117, 118, 119, 122, 123, 125, 126, 127, 170, 171, 173, 174, 175, 181
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Theorem (J.-P. Allouche, J. Shallit, G. Skordev): This sequence = A052499 - 1.
A104326(n) = A007088(a(n)); A023416(a(n)) = A087116(a(n)); A107782(a(n)) = 0; A107345(a(n)) = 1; A107359(n) = a(n+1)-a(n); A104326(n) = A007088(a(n)); a(A001911(n)) = A000225(n); a(A000071(n+2)) = A000975(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 25 2005
|
|
REFERENCES
|
David Garth and Adam Gouge, Affinely Self-Generating Sets and Morphisms, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.5.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
J.-P. Allouche, J. Shallit and G. Skordev, Self-generating sets, integers with missing blocks and substitutions, Discrete Math. 292 (2005) 1-15.
|
|
CROSSREFS
|
Complement of A004753.
Adjacent sequences: A003751 A003752 A003753 this_sequence A003755 A003756 A003757
Sequence in context: A087007 A047586 A103841 this_sequence A087006 A068422 A085118
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
