login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084132 a(n)=4a(n-1)+6a(n-2), a(0)=1,a(1)=2. 3
1, 2, 14, 68, 356, 1832, 9464, 48848, 252176, 1301792, 6720224, 34691648, 179087936, 924501632, 4772534144, 24637146368, 127183790336, 656558039552, 3389334900224, 17496687838208, 90322760754176, 466271170045952 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Binomial transform of A002535.

FORMULA

a(n)=(2+sqrt(10))^n/2+(2-sqrt(10))^n/2; G.f.: (1-2x)/(1-4x-6x^2); E.g.f. : exp(2x)cosh(sqrt(10)x).

a(n) = Sum_{k, 0<=k<=n} A201730(n,k)*9^k . - DELEHAM Philippe, Dec 06 2011

PROG

(Other) sage: [lucas_number2(n, 4, -6)/2 for n in xrange(0, 22)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 14 2009]

CROSSREFS

Cf. A005667.

Sequence in context: A109869 A197777 A197608 * A084770 A086243 A206947

Adjacent sequences:  A084129 A084130 A084131 * A084133 A084134 A084135

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), May 16 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 08:59 EST 2012. Contains 205903 sequences.