login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096269 a(n) = number of distinct palindromes of length n that occur in A096268. 1
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; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

D. Damanik, Local symmetries in the period-doubling sequence, Discrete Appl. Math., 100 (2000), 115-121.

LINKS

Table of n, a(n) for n=1..105.

J.-P. Allouche, M. Baake, J. Cassaigns, and D. Damanik, Palindrome complexity, arXiv:math/0106121 [math.CO], 2001; Theoretical Computer Science, 292 (2003), 9-31.

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, Nov 01 2007

CROSSREFS

Cf. A096268.

Sequence in context: A180987 A092093 A197386 * A260437 A262677 A307742

Adjacent sequences:  A096266 A096267 A096268 * A096270 A096271 A096272

KEYWORD

nonn,easy,base

AUTHOR

N. J. A. Sloane, Jun 22 2004

EXTENSIONS

More terms from David Wasserman, Nov 01 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 22 13:47 EST 2019. Contains 329393 sequences. (Running on oeis4.)