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!)
 A164540 a(n) = 4*a(n-1) + 4*a(n-2) for n > 1; a(0) = 1, a(1) = 14. 3
 1, 14, 60, 296, 1424, 6880, 33216, 160384, 774400, 3739136, 18054144, 87173120, 420909056, 2032328704, 9812951040, 47381118976, 228776280064, 1104629596160, 5333623504896, 25753012404224, 124346543636480, 600398224162816 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Binomial transform of A164539. Second binomial transform of A164675. Inverse binomial transform of A164541. LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..164 Martin Burtscher, Igor Szczyrba, RafaĆ Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5. Index entries for linear recurrences with constant coefficients, signature (4, 4). FORMULA a(n) = 4*a(n-1) + 4*a(n-2) for n > 1; a(0) = 1, a(1) = 14. G.f.: (1+10*x)/(1-4*x-4*x^2). a(n) = ((1+3*sqrt(2))*(2+2*sqrt(2))^n + (1-3*sqrt(2))*(2-2*sqrt(2))^n)/2. PROG (MAGMA) Z:=PolynomialRing(Integers()); N:=NumberField(x^2-2); S:=[ ((1+3*r)*(2+2*r)^n+(1-3*r)*(2-2*r)^n)/2: n in [0..21] ]; [ Integers()!S[j]: j in [1..#S] ]; // Klaus Brockhaus, Aug 20 2009 CROSSREFS Cf. A164539, A164675, A164541. Sequence in context: A100171 A063492 A051799 * A140184 A264854 A189948 Adjacent sequences:  A164537 A164538 A164539 * A164541 A164542 A164543 KEYWORD nonn,easy AUTHOR Al Hakanson (hawkuu(AT)gmail.com), Aug 15 2009 EXTENSIONS Edited and extended beyond a(5) by Klaus Brockhaus, Aug 20 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.)