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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099948 Number of partitions of n such that the number of blocks is congruent to 3 mod 4. 0
1, 6, 25, 90, 302, 994, 3487, 15210, 92489, 713988, 5979480, 50184316, 412595913, 3317961318, 26241631409, 205918294518, 1622545217510, 13045429410974, 109152638729439, 969395726250226, 9255388478615017, 94973500733767432 (list; graph; refs; listen; history; internal format)
OFFSET

3,2

REFERENCES

M. Klazar, Bell numbers, their relatives and algebraic differential equations, J. Combin. Theory, A 102 (2003), 63-87.

FORMULA

G.f.: sum(x^k/[(1-x)(1-2x)...(1-kx)], k=3 (mod 4)) - Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 15 2004

EXAMPLE

a(11)=92489 because stirling2(11,3)+stirling2(11,7)+stirling2(11,11)=92489.

MAPLE

seq(sum(stirling2(n, 3+4*k), k=0..(n-3)/4), n=3..26); (Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 15 2004)

CROSSREFS

Sequence in context: A055337 A001871 A000392 * A143815 A092491 A112308

Adjacent sequences:  A099945 A099946 A099947 * A099949 A099950 A099951

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Nov 12 2004

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 15 2004

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 09:41 EST 2012. Contains 206009 sequences.