login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A268243
Number of privileged palindromes of length n in Thue-Morse sequence A010060.
1
1, 2, 2, 2, 2, 0, 4, 0, 4, 0, 4, 0, 4, 0, 0, 0, 0, 0, 2, 0, 2, 0, 4, 0, 4, 0, 4, 0, 4, 0, 2, 0, 2, 0, 2, 0, 2, 0, 4, 0, 4, 0, 4, 0, 4, 0, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 0, 0, 0, 0, 4
OFFSET
0,2
COMMENTS
It appears that all terms except a(0) are 0, 2 or 4.
LINKS
Jarkko Peltomäki, Privileged factors in the Thue-Morse word — a comparison of privileged words and palindromes, arXiv:1306.6768 [math.CO], 2013-2015 [Disc. Appl. Math., 193:187-199, 2015].
Jarkko Peltomäki, Privileged Words and Sturmian Words, Turku Centre for Computer Science, TUCS Dissertations No 214, August 2016.
Luke Schaeffer, Jeffrey Shallit, Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences, Electronic Journal of Combinatorics 23(1) (2016), #P1.25. Gives explicit formula for a(n).
CROSSREFS
Cf. A010060.
Sequence in context: A127444 A241477 A362485 * A159782 A268242 A362932
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Feb 06 2016
EXTENSIONS
More terms from Lars Blomberg, Feb 10 2016
STATUS
approved