Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069229
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069229 n*(2^n+1). +0
1
0, 3, 10, 27, 68, 165, 390, 903, 2056, 4617, 10250, 22539, 49164, 106509, 229390, 491535, 1048592, 2228241, 4718610, 9961491, 20971540, 44040213, 92274710, 192938007, 402653208, 838860825, 1744830490, 3623878683, 7516192796 (list; graph; listen)
OFFSET

0,2

FORMULA

Recurrence: a(n) = 6*a(n-1)-13*a(n-2)+12*a(n-3)-4*a(n-4). G.f.: x*(3-8*x+6*x^2)/(1-x)^2/(1-2*x)^2.

CROSSREFS

Cf. A066524.

Sequence in context: A056681 A100624 A088809 this_sequence A085948 A000471 A000501

Adjacent sequences: A069226 A069227 A069228 this_sequence A069230 A069231 A069232

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 12 2002

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 September 8 13:07 EDT 2008. Contains 143486 sequences.


AT&T Labs Research