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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A107300 a(n) = 2*a(n-1)+2*a(n-2)-2*a(n-3). 0
 3, 2, 8, 14, 40, 92, 236, 576, 1440, 3560, 8848, 21936, 54448, 135072, 335168, 831584, 2063360, 5119552, 12702656, 31517696, 78201600, 194033280, 481434368, 1194532096, 2963866368, 7353928192 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS FORMULA G.f.: (3-4*x-2*x^2)/(1-2*x-2*x^2+2*x^3). [Sep 28 2009] a(n) = 3*A077937(n)-4*A077937(n-1)-2*A077937(n-2). [Sep 28 2009] MATHEMATICA b1 = x /. NSolve[x^3 - 2*x^2 - 2*x + 2 == 0, x][[1]] b2 = x /. NSolve[x^3 - 2*x^2 - 2*x + 2 == 0, x][[2]] b3 = x /. NSolve[x^3 - 2*x^2 - 2*x + 2 == 0, x][[3]] digits = 25 a = Table[N[2*(b3^n + b1^n + b2^n)/ (b3 + b2 + b1)], {n, 0, digits}] CROSSREFS Sequence in context: A301903 A165660 A171634 * A285787 A047946 A066045 Adjacent sequences:  A107297 A107298 A107299 * A107301 A107302 A107303 KEYWORD nonn,easy AUTHOR Roger L. Bagula, May 20 2005 EXTENSIONS Definition replaced by recurrence by the Associate Editors of the OEIS, Sep 28 2009 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 January 22 13:41 EST 2020. Contains 331149 sequences. (Running on oeis4.)