Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108851
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108851 a(n) = 4a(n-1) + 3a(n-2), a(0) = 1, a(1) = 2. +0
2
1, 2, 11, 50, 233, 1082, 5027, 23354, 108497, 504050, 2341691, 10878914, 50540729, 234799658, 1090820819, 5067682250, 23543191457, 109375812578, 508132824683, 2360658736466, 10967033419913, 50950109889050 (list; graph; listen)
OFFSET

0,2

COMMENT

Binomial transform of A083098, second binomial transform of (1, 0, 7, 0, 49, 0, 243, 0, ..).

FORMULA

a(n) = ((2 + sqrt(7))^n + (2 - sqrt(7))^n) / 2.

G.f.: (1 - 2x) / (1 - 4x - 3x^2).

E.g.f.: exp(2x)cosh(sqrt(7)x).

a(n+1)/a(n) converges to 2 + sqrt(7) = 4.645751311064...

PROGRAM

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

CROSSREFS

Cf. A080042 [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 14 2009]

Sequence in context: A036996 A151314 A154415 this_sequence A105486 A137960 A018933

Adjacent sequences: A108848 A108849 A108850 this_sequence A108852 A108853 A108854

KEYWORD

easy,nonn

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jul 11 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research