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!)
A027939 a(n) = T(2*n, n+3), T given by A027935. 1
1, 29, 247, 1300, 5270, 18228, 56967, 166681, 467301, 1274856, 3419252, 9076280, 23945893, 62955061, 165188091, 432974764, 1134224458, 2970340412, 7777628427, 20363608737, 53314542953, 139581703056, 365432651464, 956718812272, 2504726904937, 6557465674125 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,2
LINKS
FORMULA
G.f.: x^3*(1+20*x+20*x^2-8*x^3-x^4) / ((1-x)^6*(1-3*x+x^2)). - Colin Barker, Feb 20 2016
a(n) = Fibonacci(2*n+7) - (195 + 186*n + 90*n^2 + 35*n^3 + 4*n^5)/15. - G. C. Greubel, Sep 28 2019
MAPLE
with(combinat); seq(fibonacci(2*n+7) - (195 +186*n +90*n^2 +35*n^3 +4*n^5)/15, n=3..30); # G. C. Greubel, Sep 28 2019
MATHEMATICA
Table[Fibonacci[2*n+7] -(195 +186*n +90*n^2 +35*n^3 +4*n^5)/15, {n, 3, 30}] (* G. C. Greubel, Sep 28 2019 *)
PROG
(PARI) vector(30, n, my(m=n+2); fibonacci(2*m+7) - (195 +186*m +90*m^2 +35*m^3 +4*m^5)/15) \\ G. C. Greubel, Sep 28 2019
(Magma) [Fibonacci(2*n+7) - (195 +186*n +90*n^2 +35*n^3 +4*n^5)/15: n in [3..30]]; // G. C. Greubel, Sep 28 2019
(Sage) [fibonacci(2*n+7) - (195 +186*n +90*n^2 +35*n^3 +4*n^5)/15 for n in (3..30)] # G. C. Greubel, Sep 28 2019
(GAP) List([3..30], n-> Fibonacci(2*n+7) - (195 +186*n +90*n^2 +35*n^3 +4*n^5)/15 ); # G. C. Greubel, Sep 28 2019
CROSSREFS
Sequence in context: A125366 A126524 A334690 * A146127 A146038 A142683
KEYWORD
nonn
AUTHOR
EXTENSIONS
Terms a(23) onward added by G. C. Greubel, Sep 28 2019
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 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)