A306862 A binary sequence with property that k*pal(k)/fac(k) is unbounded, where fac() and pac() are respectively complexity and palindromic complexity.

1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1

Offset

0

Comments

See Allouche et al. (2003) Remark 9 for the rather complicated recursive definition.

Links

Table of n, a(n) for n=0..68.

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.

Crossrefs

Sequence in context: A143221 A325899 A126999 * A363801 A347283 A214293

Adjacent sequences: A306859 A306860 A306861 * A306863 A306864 A306865

Keyword

nonn,more

Author

N. J. A. Sloane, Mar 14 2019

Status

approved