The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049654 a(n) = (F(8*n+1) - 1)/3 where F=A000045 (the Fibonacci sequence). 1
 0, 11, 532, 25008, 1174859, 55193380, 2592914016, 121811765387, 5722560059188, 268838511016464, 12629687457714635, 593326472001571396, 27873714496616140992, 1309471254868957055243, 61517275264344365455444 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS G. C. Greubel, Table of n, a(n) for n = 0..595 Index entries for linear recurrences with constant coefficients, signature (48,-48,1). FORMULA G.f.: -x*(11+4*x) / ( (x-1)*(x^2-47*x+1) ). - R. J. Mathar, Oct 26 2015 a(n) = 11*|A156093(n)|+4*|A156093(n-1)|. - R. J. Mathar, Oct 26 2015 MATHEMATICA LinearRecurrence[{48, -48, 1}, {0, 11, 532}, 50] (* or *) Table[( Fibonacci[8*n+1]-1)/3, {n, 0, 30}] (* G. C. Greubel, Dec 02 2017 *) PROG (PARI) for(n=0, 30, print1((fibonacci(8*n+1) - 1)/3, ", ")) \\ G. C. Greubel, Dec 02 2017 (MAGMA) [(Fibonacci(8*n+1) - 1)/3: n in [0..30]]; // G. C. Greubel, Dec 02 2017 CROSSREFS Cf. A156093. Sequence in context: A322065 A065823 A233198 * A179897 A185203 A265978 Adjacent sequences:  A049651 A049652 A049653 * A049655 A049656 A049657 KEYWORD nonn,easy AUTHOR 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 September 23 20:42 EDT 2021. Contains 347617 sequences. (Running on oeis4.)