Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001475
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001475 a(n) = a(n-1) + n a(n-2).
(Formerly M1449 N0573)
+0
3
1, 2, 5, 13, 38, 116, 382, 1310, 4748, 17848, 70076, 284252, 1195240, 5174768, 23103368, 105899656, 498656912, 2404850720, 11879332048, 59976346448 (list; graph; listen)
OFFSET

1,2

REFERENCES

J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 86 (divided by 2).

FORMULA

E.g.f.: 1/2*(1+x)*exp(x+1/2*x^2)-1/2. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Nov 04 2003

CROSSREFS

Equals (1/2) A000085(n+1). Cf. A001189, A013989.

Sequence in context: A053732 A119495 A064384 this_sequence A000800 A006823 A022894

Adjacent sequences: A001472 A001473 A001474 this_sequence A001476 A001477 A001478

KEYWORD

nonn

AUTHOR

njas

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research