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!)
A087423 a(n)=S(3*n,3)/S(n,3) where S(n,m)=sum(k=0,n,binomial(n,k)*fibonacci(m*k)). 1
32, 768, 20672, 565248, 15491072, 424685568, 11643256832, 319215894528, 8751751626752, 239941585993728, 6578336360824832, 180354352643309568, 4944668491903926272, 135565048129674805248, 3716706651755063017472, 101898745479045492768768 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..16.

Index entries for linear recurrences with constant coefficients, signature (32,-128,64).

FORMULA

a(n) = 4^n+(14+6*sqrt(5))^n+(14-6*sqrt(5))^n.

G.f.: -32*x*(6*x^2-8*x+1) / ((4*x-1)*(16*x^2-28*x+1)). - Colin Barker, Dec 01 2012

MATHEMATICA

LinearRecurrence[{32, -128, 64}, {32, 768, 20672}, 20] (* Harvey P. Dale, Feb 17 2018 *)

CROSSREFS

Cf. A020876.

Sequence in context: A283695 A283127 A295713 * A004384 A248071 A183215

Adjacent sequences:  A087420 A087421 A087422 * A087424 A087425 A087426

KEYWORD

nonn,easy

AUTHOR

Benoit Cloitre, Oct 22 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 00:40 EST 2022. Contains 350410 sequences. (Running on oeis4.)