|
| |
|
|
A164539
|
|
a(n) = 2*a(n-1)+7*a(n-2) for n > 1; a(0) = 1, a(1) = 13.
|
|
3
| |
|
|
1, 13, 33, 157, 545, 2189, 8193, 31709, 120769, 463501, 1772385, 6789277, 25985249, 99495437, 380887617, 1458243293, 5582699905, 21373102861, 81825105057, 313261930141, 1199299595681, 4591432702349, 17577962574465, 67295954065373
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Binomial transform of A164675. Inverse binomial transform of A164540.
|
|
|
LINKS
| Vincenzo Librandi and Harvey P. Dale, Table of n, a(n) for n = 0..1000 (Vincenzo Librandi to 177)
|
|
|
FORMULA
| a(n) = 2*a(n-1)+7*a(n-2) for n > 1; a(0) = 1, a(1) = 13.
G.f.: (1+11*x)/(1-2*x-7*x^2).
a(n) = ((1+3*sqrt(2))*(1+2*sqrt(2))^n+(1-3*sqrt(2))*(1-2*sqrt(2))^n)/2.
|
|
|
MATHEMATICA
| LinearRecurrence[{2, 7}, {1, 13}, 50] (* From Harvey P. Dale, Oct 16 2011 *)
|
|
|
PROG
| (MAGMA) Z<x>:=PolynomialRing(Integers()); N<r>:=NumberField(x^2-2); S:=[ ((1+3*r)*(1+2*r)^n+(1-3*r)*(1-2*r)^n)/2: n in [0..23] ]; [ Integers()!S[j]: j in [1..#S] ]; [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 20 2009]
|
|
|
CROSSREFS
| Cf. A164675, A164540.
Sequence in context: A146194 A204707 A124659 * A134864 A093100 A081271
Adjacent sequences: A164536 A164537 A164538 * A164540 A164541 A164542
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Al Hakanson (hawkuu(AT)gmail.com), Aug 15 2009
|
|
|
EXTENSIONS
| Edited and extended beyond a(5) by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 20 2009
|
| |
|
|
