Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133467
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133467 a(n)=a(n-1)+6*a(n-2) for n>=2, a(0)=1, a(1)=2 . +0
1
1, 2, 8, 20, 68, 188, 596, 1724, 5300, 15644, 47444, 141308, 425972, 1273820, 3829652, 11472572, 34450484, 103285916, 309988820, 929704316, 2789637236, 8367863132, 25105686548, 75312865340, 225946984628, 677824176668 (list; graph; listen)
OFFSET

0,2

FORMULA

G.f.: (1+x)/(1-x-6*x^2) .

a(n)=Sum_{k, 0<=k<=n+1}A122950(n+1,k)*5^(n+1-k). - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jan 08 2008

a(n)=(4/5)*3^n+(1/5)*(-2)^n, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Nov 18 2008]

a(n)=0.8*3^n+0.2*(-2)^n [From Richard Choulet (richardchoulet(AT)yahoo.fr), Nov 19 2008]

PROGRAM

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

CROSSREFS

Sequence in context: A081157 A099177 A100097 this_sequence A091004 A005559 A001471

Adjacent sequences: A133464 A133465 A133466 this_sequence A133468 A133469 A133470

KEYWORD

easy,nonn,new

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jan 03 2008

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 4 21:30 EST 2008. Contains 151309 sequences.


AT&T Labs Research