id:A115624 - OEIS Search Results

Search: id:A115624

Displaying 1-1 of 1 results found.

page 1

Number of iterations of signature function required to get to [1] from partitions in Mathematica order.

+0
3

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; listen)

	OFFSET	`1,3`
	COMMENT	`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.` `Adjacent sequences: A115621 A115622 A115623 this_sequence A115625 A115626 A115627` `Sequence in context: A132283 A088370 A113787 this_sequence A076291 A124458 A002973`
	KEYWORD	`easy,nonn`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jan 25 2006`

page 1

Search completed in 0.002 seconds

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.

AT&T Labs Research