Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081670
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081670 3^n-1+C(2n,n). +0
2
1, 4, 14, 46, 150, 494, 1652, 5618, 19430, 68302, 243804, 882578, 3235596, 11994922, 44899568, 169466426, 644127110, 2462746382, 9462555788, 36507525266, 141333313220, 548718227642, 2135480023328, 8327573906426, 32530033219580 (list; graph; listen)
OFFSET

0,2

COMMENT

Binomial transform of A081669

FORMULA

a(n)=A000984(n)+2*A003462(n) E.g.f. exp(3x)-exp(x)+exp(2x)BesselI_0(2x)

CROSSREFS

Adjacent sequences: A081667 A081668 A081669 this_sequence A081671 A081672 A081673

Sequence in context: A026290 A027649 A049221 this_sequence A124805 A121530 A121299

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Mar 28 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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research