login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002051 Differences of 0.
(Formerly M4644 N1986)
2
1, 9, 67, 525, 4651, 47229, 545707, 7087005, 102247051, 1622631549, 28091565547, 526858344285, 10641342962251, 230283190961469, 5315654681948587 (list; graph; refs; listen; history; internal format)
OFFSET

3,2

REFERENCES

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

J. F. Steffensen, On a class of polynomials and their application to actuarial problems, Skandinavisk Aktuarietidskrift, Vol. 11, pp. 75-97, 1928.

LINKS

T. D. Noe, Table of n, a(n) for n=0..100

FORMULA

A002051(n) = A000670(n) - 2^(n-1) - Manfred Goebel (mkgoebel(AT)essex.ac.uk), Feb 20, 2000

MATHEMATICA

a[n_] := Sum[ k!*StirlingS2[n-1, k], {k, 0, n-1}] - 2^(n-2); Table[a[n], {n, 3, 17}] (* From Jean-François Alcover, Nov 18 2011, after Manfred Goebel *)

CROSSREFS

Sequence in context: A016130 A115202 A155592 * A133120 A194650 A048742

Adjacent sequences:  A002048 A002049 A002050 * A002052 A002053 A002054

KEYWORD

nonn,easy,nice

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 16:28 EST 2012. Contains 206050 sequences.