Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123270
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123270 a(0)=1, a(1)=1, a(n)=5*a(n-1)+4*a(n-2). +0
2
1, 1, 9, 49, 281, 1601, 9129, 52049, 296761, 1692001, 9647049, 55003249, 313604441, 1788035201, 10194593769, 58125109649, 331403923321, 1889520055201, 10773215969289, 61424160067249, 350213664213401, 1996764961336001 (list; graph; listen)
OFFSET

0,3

COMMENT

First differences give {0, 8, 40, 232, 1320, 7528, 42920, ...} = 8*A015537(n) = 8 * {0, 1, 5, 29, 165, 941, 5365, ...}. - Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 03 2006

FORMULA

a(n)=Sum_{k, 0<=k<=n}4^(n-k)*A122542(n,k) . G.f. (1-4*x)/(1-5*x-4*x^2)

a(n) = 1 + 8*Sum[ A015537(k), {k,0,n} ]. - Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 03 2006

a(n)=(1/2)*[5/2-(1/2)*sqrt(41)]^n-(3/82)*sqrt(41)*[5/2+(1/2)*sqrt(41)]^n+(3/82)*sqrt(41)*[5/2-(1 /2)*sqrt(41)]^n+(1/2)*[5/2+(1/2)*sqrt(41)]^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jul 07 2008

CROSSREFS

Cf. A015537.

Sequence in context: A081655 A055428 A012231 this_sequence A114040 A090390 A069665

Adjacent sequences: A123267 A123268 A123269 this_sequence A123271 A123272 A123273

KEYWORD

nonn

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 09 2006

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research