This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129728 a(n) = 2*n-2 + Fibonacci(n). 1
 1, 3, 6, 9, 13, 18, 25, 35, 50, 73, 109, 166, 257, 403, 638, 1017, 1629, 2618, 4217, 6803, 10986, 17753, 28701, 46414, 75073, 121443, 196470, 317865, 514285, 832098, 1346329, 2178371, 3524642, 5702953, 9227533, 14930422, 24157889, 39088243 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Old name was: A palindromic complexity sequence based on the Fibonacci numbers. a(1)=1 gives more primes than a(1)=2 for some reason. LINKS Vincenzo Librandi, 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. Index entries for linear recurrences with constant coefficients, signature (3,-2,-1,1). FORMULA a(n) = a(n-1) + Fibonacci(n) - Fibonacci(n-1) + 2 G.f.: x*(2*x^3+x^2-1)/((x-1)^2*(x^2+x-1)). - Colin Barker, Nov 08 2012 a(n) = A005843(n-1) + A000045(n). - Gary Detlefs, Dec 31 2012 MATHEMATICA P[1] = 1; P[n_] := P[n] = P[n - 1] + Fibonacci[n] - Fibonacci[n - 1] + 2; Table[P[n], {n, 1, 50}] PROG (PARI) a(n)=2*n-2+fibonacci(n) \\ Charles R Greathouse IV, Oct 03 2013 (MAGMA) [2*n-2+Fibonacci(n): n in [1..45]]; // Vincenzo Librandi, Oct 05 2013 CROSSREFS Sequence in context: A033436 A059293 A002578 * A307270 A310160 A117469 Adjacent sequences:  A129725 A129726 A129727 * A129729 A129730 A129731 KEYWORD nonn,easy AUTHOR Roger L. Bagula, May 12 2007 EXTENSIONS New name from Gary Detlefs, Dec 31 2012 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 18 06:56 EDT 2019. Contains 324203 sequences. (Running on oeis4.)