This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129730 Upper limit palindromic complexity sequence for Fibonacci. 0
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Petr Ambroz, Christiane Frougny, Zuzana Masakova and Edita Pelantova, Palindromic complexity of infinite words associated with simple Parry numbers, arXiv:math/0603608. FORMULA a(n) = Ceiling[(16/(n + 1))*Fibonacci[n + 1 + Floor[(n + 1)/4]]] MATHEMATICA p[n_] := Ceiling[(16/(n + 1))*Fibonacci[n + 1 + Floor[(n + 1)/4]]]; Table[p[n], {n, 1, 50}] CROSSREFS Sequence in context: A000873 A213084 A243520 * A291664 A318347 A195160 Adjacent sequences:  A129727 A129728 A129729 * A129731 A129732 A129733 KEYWORD nonn,uned AUTHOR Roger L. Bagula, May 12 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 17 22:17 EDT 2019. Contains 324200 sequences. (Running on oeis4.)