|
Search: id:A096269
|
|
|
| A096269 |
|
a(n) = number of distinct palindromes of length n that occur in A096268. |
|
+0
2
|
|
| 2, 1, 3, 0, 4, 0, 3, 0, 4, 0, 4, 0, 3, 0, 3, 0, 4, 0, 4, 0, 4, 0, 4, 0, 3, 0, 3, 0, 3, 0, 3, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 3, 0, 3, 0, 3, 0, 3, 0, 3, 0, 3, 0, 3, 0, 3, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 3, 0, 3, 0, 3, 0, 3, 0, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
D. Damanik, Local symmetries in the period-doubling sequence, Discrete Appl. Math., 100 (2000), 115-121.
|
|
LINKS
|
J.-P. Allouche, M. Baake, J. Cassaigns and D. Damanik, Palindrome complexity
|
|
FORMULA
|
For even n >= 4, a(n) = 0; for odd n >= 5, a(n) = a(2n-1) = a(2n+1).
For odd n >= 5, let x be the power of 2 closest to n; if n > x then a(n) = 4 and if n < x then a(n) = 3. - David Wasserman (dwasserm(AT)earthlink.net), Nov 01 2007
|
|
CROSSREFS
|
Cf. A096268.
Sequence in context: A066029 A141198 A092093 this_sequence A073312 A166514 A160588
Adjacent sequences: A096266 A096267 A096268 this_sequence A096270 A096271 A096272
|
|
KEYWORD
|
nonn,easy,base
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jun 22 2004
|
|
EXTENSIONS
|
More terms from David Wasserman (dwasserm(AT)earthlink.net), Nov 01 2007
|
|
|
Search completed in 0.002 seconds
|
