Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038159
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038159 a(n) = n*a(n-1) + 1, a(0) = 2. +0
3
2, 3, 7, 22, 89, 446, 2677, 18740, 149921, 1349290, 13492901, 148421912, 1781062945, 23153818286, 324153456005, 4862301840076, 77796829441217, 1322546100500690, 23805829809012421, 452310766371236000, 9046215327424720001, 189970521875919120022 (list; graph; listen)
OFFSET

0,1

FORMULA

n!*(1+Sum(1/k!, k=0..n)).

E.g.f.: (1+exp(x))/(1-x).

MATHEMATICA

s=3; lst={2, s}; Do[s+=s++n; AppendTo[lst, Abs[s]], {n, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 23 2008]

CROSSREFS

A038159(n) = A000522(n) + n!.

A033540(n+1) + 1.

Sequence in context: A010738 A114599 A094062 this_sequence A077210 A151908 A072214

Adjacent sequences: A038156 A038157 A038158 this_sequence A038160 A038161 A038162

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Comments from Michael Somos

page 1

Search completed in 0.005 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research