Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080040
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080040 a(n)=2a(n-1)+2a(n-2), a(0)=2, a(1)=2. +0
8
2, 2, 8, 20, 56, 152, 416, 1136, 3104, 8480, 23168, 63296, 172928, 472448, 1290752, 3526400, 9634304, 26321408, 71911424, 196465664, 536754176, 1466439680, 4006387712, 10945654784, 29904084992, 81699479552, 223207129088 (list; graph; listen)
OFFSET

0,1

LINKS

Index entries for sequences related to linear recurrences with constant coefficients

Tanya Khovanova, Recursive Sequences

FORMULA

G.f.: g(t)=(2-2t)/(1-2t-2t^2) a(n)=(1+sqrt(3))^n+(1-sqrt(3))^n

a(n)=2*A026150(n). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 19 2008]

MATHEMATICA

CoefficientList[Series[(2 - 2t)/(1 - 2t - 2t^2), {t, 0, 30}], t]

PROGRAM

sage: from sage.combinat.sloane_functions import recur_gen2b sage: it = recur_gen2b(2, 2, 2, 2, lambda n: 0) sage: [it.next() for i in range(27)] - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 16 2008

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

CROSSREFS

Sequence in context: A168506 A067640 A098277 this_sequence A060823 A167532 A151377

Adjacent sequences: A080037 A080038 A080039 this_sequence A080041 A080042 A080043

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Jan 21 2003

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 17 15:31 EDT 2010. Contains 173524 sequences.


AT&T Labs Research