A129730 - OEIS

%I #13 Sep 08 2022 08:45:30

%S 8,11,20,26,35,48,110,159,231,339,814,1215,1826,2757,6765,10303,15744,

%T 24133,60020,92490,142850,221086,554694,861613,1340498,2088639,

%U 5272838,8237436,12884170,20174539,51167078,80281281,126077316,198168886

%N Upper limit palindromic complexity sequence involving Fibonacci numbers.

%H G. C. Greubel, <a href="/A129730/b129730.txt">Table of n, a(n) for n = 1..1000</a>

%H Petr Ambroz, Christiane Frougny, Zuzana Masakova and Edita Pelantova, <a href="http://arxiv.org/abs/math/0603608">Palindromic complexity of infinite words associated with simple Parry numbers</a>, arXiv:math/0603608 [math.CO], 2006.

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

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

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

%o (PARI) vector(35, n, ceil(16*fibonacci(n+1 + (n+1)\4 )/(n+1)) ) \\ _G. C. Greubel_, Dec 02 2019

%o (Magma) [Ceiling(16*Fibonacci(n+1 +Floor((n+1)/4))/(n+1)): n in [1..35]]; // _G. C. Greubel_, Dec 02 2019

%o (Sage) [ceil(16*fibonacci(n+1 +floor((n+1)/4))/(n+1)) for n in (1..35)] # _G. C. Greubel_, Dec 02 2019

%Y Cf. A000045, A129728.

%K nonn

%O 1,1

%A _Roger L. Bagula_, May 12 2007

%E Edited by _G. C. Greubel_, Dec 02 2019