|
%I #21 Oct 07 2020 10:26:01
%S 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,
%T 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,
%U 2,0,2,0,2,0,2,0,2,0,2,0,2,0,0,0,0,0,4
%N Number of privileged palindromes of length n in Thue-Morse sequence A010060.
%C It appears that all terms except a(0) are 0, 2 or 4.
%H Lars Blomberg, <a href="/A268243/b268243.txt">Table of n, a(n) for n = 0..10000</a>
%H Jarkko Peltomäki, <a href="http://arxiv.org/abs/1306.6768">Privileged factors in the Thue-Morse word — a comparison of privileged words and palindromes</a>, arXiv:1306.6768 [math.CO], 2013-2015 [Disc. Appl. Math., 193:187-199, 2015].
%H Jarkko Peltomäki, <a href="https://www.utupub.fi/handle/10024/124473">Privileged Words and Sturmian Words</a>, Turku Centre for Computer Science, TUCS Dissertations No 214, August 2016.
%H Luke Schaeffer, Jeffrey Shallit, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p25">Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences</a>, Electronic Journal of Combinatorics 23(1) (2016), #P1.25. Gives explicit formula for a(n).
%Y Cf. A010060.
%K nonn
%O 0,2
%A _N. J. A. Sloane_, Feb 06 2016
%E More terms from _Lars Blomberg_, Feb 10 2016
|
