login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
FORMULA
From R. J. Mathar, Oct 26 2015: (Start)
G.f.: -x*(11+4*x) / ( (x-1)*(x^2-47*x+1) ).
a(n) = 11*|A156093(n)|+4*|A156093(n-1)|. (End)
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 *)
CoefficientList[Series[-x(11+4x)/((x-1)(x^2-47*x+1)), {x, 0, 14}], x] (* Stefano Spezia, Feb 18 2024 *)
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
Sequence in context: A065823 A233198 A358162 * A179897 A185203 A363460
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 30 20:43 EDT 2024. Contains 372141 sequences. (Running on oeis4.)