|
| |
|
|
A115624
|
|
Number of iterations of signature function required to get to [1] from partitions in Mathematica order.
|
|
2
| |
|
|
0, 1, 2, 1, 3, 2, 1, 3, 2, 4, 2, 1, 3, 3, 4, 4, 4, 2, 1, 3, 3, 4, 2, 3, 4, 2, 3, 4, 2, 1, 3, 3, 4, 3, 3, 4, 4, 4, 5, 4, 4, 4, 4, 2, 1, 3, 3, 4, 3, 3, 4, 2, 3, 4, 5, 4, 4, 3, 5, 5, 4, 2, 4, 4, 4, 2, 1, 3, 3, 4, 3, 3, 4, 3, 3, 4, 5, 4, 4, 3, 5, 5, 5, 4, 2, 5, 4, 4, 5, 5, 4, 4, 3, 4, 4, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| The signature function takes a partition to the partition consisting of its repetition factors.
|
|
|
EXAMPLE
| Partition 5 in Mathematica order is [2,1]. Applying the signature function to this repeatedly gives [2,1] -> [1^2] -> [2] -> [1], so a(5)=3.
|
|
|
CROSSREFS
| Cf. A115621, A113787, Sequence of first partitions with a(m)=n is A012257, with initial rows {1} and {2} in prepended. See A080577 for Mathematica partition order.
Sequence in context: A132283 A088370 A113787 * A076291 A194968 A194980
Adjacent sequences: A115621 A115622 A115623 * A115625 A115626 A115627
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jan 25 2006
|
| |
|
|
