Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127261
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127261 a(0)=2, a(1)=2, a(n)=2*a(n-1)+10*a(n-2). +0
2
2, 2, 24, 68, 376, 1432, 6624, 27568, 121376, 518432, 2250624, 9685568, 41877376, 180610432, 779994624, 3366093568, 14532133376, 62725202432, 270771738624, 1168795501568, 5045308389376 (list; graph; listen)
OFFSET

0,1

FORMULA

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

MAPLE

a[0]:=2:a[1]:=2:for i from 2 to 40 do a[i]:=2*a[i-1]+10*a[i-2] od: seq(a[n], n=0..40);

PROGRAM

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

CROSSREFS

Sequence in context: A120065 A131448 A156447 this_sequence A032336 A032084 A120979

Adjacent sequences: A127258 A127259 A127260 this_sequence A127262 A127263 A127264

KEYWORD

easy,nonn

AUTHOR

Miklos Kristof (kristmikl(AT)freemail.hu), Mar 27 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research