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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124504 Number of partitions of an n-set without blocks of size 3. 1
1, 1, 2, 4, 11, 32, 113, 422, 1788, 8015, 39435, 204910, 1144377, 6722107, 41877722, 273328660, 1875326627, 13427171644, 100415636519, 780856389454, 6312398830812, 52891894374481, 459022366424253, 4117482357137214 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

a(n)=A124503(n,0).

FORMULA

E.g.f.: exp(exp(x)-1-x^3/6).

EXAMPLE

a(3)=4 because if the set is {1,2,3}, then we have 1|2|3, 1|23, 12|3 and 13|2.

MAPLE

G:=exp(exp(x)-1-x^3/6): Gser:=series(G, x=0, 30): seq(n!*coeff(Gser, x, n), n=0..26);

CROSSREFS

Cf. A124503.

Sequence in context: A156043 A148171 A113774 * A056324 A056325 A103293

Adjacent sequences:  A124501 A124502 A124503 * A124505 A124506 A124507

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 14 2006

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 13 18:33 EST 2012. Contains 205535 sequences.