|
Search: id:A002846
|
|
|
| A002846 |
|
Number of ways of transforming a set of n indistinguishable objects into n singletons via a sequence of n-1 refinements.
(Formerly M1251 N0478)
|
|
+0
1
|
|
| 1, 1, 1, 2, 4, 11, 33, 116, 435, 1832, 8167, 39700, 201785, 1099449, 6237505, 37406458, 232176847, 1513796040, 10162373172, 71158660160, 511957012509, 3819416719742, 29195604706757, 230713267586731, 1861978821637735
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
P. Erdos, R. K. Guy and J. W. Moon, On refining partitions, J. London Math. Soc., 9 (1975), 565-570.
|
|
EXAMPLE
|
a(5) = 4 because there are 4 paths from top to bottom in this lattice:
.....ooooo.......
.../......\......
o.oooo...oo.ooo..
..|....X....|....
o.o.ooo..o.oo.oo.
...\......./.....
....o.o.o.oo.....
........|........
....o.o.o.o.o....
|
|
MATHEMATICA
|
<<posets.m Table[Build[NumP[n], np]; Last@MaximalChainsDown@np, {n, 1, 25}] - (Harris)
|
|
CROSSREFS
|
Adjacent sequences: A002843 A002844 A002845 this_sequence A002847 A002848 A002849
Sequence in context: A025191 A035354 A127782 this_sequence A123444 A123473 A123462
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
a(17)-a(25) from Mitch Harris, Jan 19 2006
|
|
|
Search completed in 0.002 seconds
|
