id:A067627 - OEIS Search Results

Search: id:A067627

Displaying 1-1 of 1 results found.

page 1

Triangle T(n,k) = number of conjugacy classes of partitions of n using only k types of piles, read by rows.

+0
1

1, 1, 1, 1, 1, 2, 3, 1, 1, 3, 2, 1, 6, 1, 3, 7, 2, 5, 9, 2, 1, 8, 11, 2, 1, 13, 14, 1, 3, 19, 15, 3, 5, 27, 19, 1, 11, 34, 22, 2, 1, 15, 49, 23, 2 (list; graph; listen)

	OFFSET	`1,6`
	COMMENT	`Lengths of rows are 1 1 2 2 2 3 3 3 3 4 4 4 4 4 ... (A003056).`
	EXAMPLE	`Triangle turned on its side begins:` `1.1.1.2.1.2.1.2.2..2..1..3..1..2..2....etc` `....1.1.3.3.6.7.9.11.14.15.19.22.23....etc` `..........1.1.3.5..8.13.19.27.34.49....etc` `...................1..1..3..5.11.15....etc`
	CROSSREFS	`Cf. A000700, A000701, A046682, A060177. Diagonals give A038548. row sums give A046682.` `Sequence in context: A152735 A046226 A054722 this_sequence A077233 A123185 A133569` `Adjacent sequences: A067624 A067625 A067626 this_sequence A067628 A067629 A067630`
	KEYWORD	`easy,more,nonn,tabf`
	AUTHOR	`Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 02 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research