Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127226
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127226 a(0)=2, a(1)=2, a(n)=2*a(n-1)+6*a(n-2). +0
5
2, 2, 16, 44, 184, 632, 2368, 8528, 31264, 113696, 414976, 1512128, 5514112, 20100992, 73286656, 267179264, 974078464, 3551232512, 12946935808, 47201266688, 172084148224, 627375896576, 2287256682496 (list; graph; listen)
OFFSET

0,1

COMMENT

If A083099(n-1)=F(n)=0,1,2,10,32... is the Fibonacci-type sequence, then a(n)=L(n) is the Lucas-type sequence. L(n)=F(n+1)+6*F(n-1)

FORMULA

G(x)=2*(1-x)/(1-6x-2x^2) E(x)=(exp((1+sqrt(7))x)+exp((1-sqrt(7))x)) a(n)=A083099(n)+6*A083099(n-2)

a(n)=[1+sqrt(7)]^n+[1-sqrt(7)]^n, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Jul 31 2008]

PROGRAM

(Other) sage: [lucas_number2(n, 2, -6) for n in xrange(0, 23)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 30 2009]

CROSSREFS

Cf. A083099.

Sequence in context: A113123 A076615 A098777 this_sequence A001119 A062282 A012319

Adjacent sequences: A127223 A127224 A127225 this_sequence A127227 A127228 A127229

KEYWORD

easy,nonn

AUTHOR

Miklos Kristof (kristmikl(AT)freemail.hu), Mar 26 2007

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 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research