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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032011 Partition n labeled elements into sets of different sizes and order the sets. 3
1, 1, 7, 9, 31, 403, 757, 2873, 12607, 333051, 761377, 3699435, 16383121, 108710085, 4855474267, 13594184793, 76375572751, 388660153867, 2504206435681, 20148774553859, 1556349601444477, 5050276538344665 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..22.

C. G. Bower, Transforms (2)

FORMULA

"AGJ" (ordered, elements, labeled) transform of 1, 1, 1, 1, ...

MATHEMATICA

f[list_]:=Apply[Multinomial, list]*Length[list]!; Table[Total[Map[f, Select[IntegerPartitions[n], Sort[#] == Union[#] &]]], {n, 1, 30}]

CROSSREFS

Cf. A000670, A032020, A114902.

Sequence in context: A147248 A147186 A131623 * A177030 A189974 A083203

Adjacent sequences:  A032008 A032009 A032010 * A032012 A032013 A032014

KEYWORD

nonn

AUTHOR

Christian G. Bower, Apr 01 1998

STATUS

approved

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 May 18 07:10 EDT 2013. Contains 225419 sequences.