A129730 Upper limit palindromic complexity sequence involving Fibonacci numbers.

8, 11, 20, 26, 35, 48, 110, 159, 231, 339, 814, 1215, 1826, 2757, 6765, 10303, 15744, 24133, 60020, 92490, 142850, 221086, 554694, 861613, 1340498, 2088639, 5272838, 8237436, 12884170, 20174539, 51167078, 80281281, 126077316, 198168886

Offset

1,1

Links

G. C. Greubel, Table of n, a(n) for n = 1..1000

Petr Ambroz, Christiane Frougny, Zuzana Masakova and Edita Pelantova, Palindromic complexity of infinite words associated with simple Parry numbers, arXiv:math/0603608 [math.CO], 2006.

Formula

a(n) = ceiling(16*Fibonacci(n+1 + floor((n+1)/4))/(n+1)).

Maple

with(combinat); seq(ceil(16*fibonacci(n+1 + floor((n+1)/4))/(n+1)), n=1..35); # G. C. Greubel, Dec 02 2019

Mathematica

Table[Ceiling[16*Fibonacci[n+1 +Floor[(n+1)/4]]/(n+1)], {n, 35}]

Prog

(PARI) vector(35, n, ceil(16*fibonacci(n+1 + (n+1)\4 )/(n+1)) ) \\ G. C. Greubel, Dec 02 2019
(Magma) [Ceiling(16*Fibonacci(n+1 +Floor((n+1)/4))/(n+1)): n in [1..35]]; // G. C. Greubel, Dec 02 2019
(Sage) [ceil(16*fibonacci(n+1 +floor((n+1)/4))/(n+1)) for n in (1..35)] # G. C. Greubel, Dec 02 2019

Crossrefs

Cf. A000045, A129728.

Sequence in context: A000873 A213084 A243520 * A347757 A368356 A291664

Adjacent sequences: A129727 A129728 A129729 * A129731 A129732 A129733

Keyword

nonn

Author

Roger L. Bagula, May 12 2007

Extensions

Edited by G. C. Greubel, Dec 02 2019

Status

approved