id:A120565 - OEIS Search Results

Search: id:A120565

Displaying 1-1 of 1 results found.

page 1

A120565

Maximum over all planar partitions of n of the number of ways the partition can be shrunk by removing a single element.

+0
2

0, 1, 1, 2, 3, 3, 3, 4, 4, 5, 6, 6, 6, 6, 7, 7, 7, 8, 8, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 13, 13, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 19, 19, 20, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 24, 24 (list; graph; listen)

	OFFSET	`0,4`
	COMMENT	`Maximum of any sum_i k_i, where sum_i k_i*(k_i+1)/2 <= n.`
	FORMULA	`For n > 2, let m be the largest value such that tetrahedral number m(m+1)(m+2)/6 <= n. Then a(n) = max(m(m+1)/2, m+1 + a(n - (m+1)(m+2)/2)), taking a(k) to be 0 for k < 0.`
	CROSSREFS	`Row lengths of A098529.` `Sequence in context: A029119 A087823 A037037 this_sequence A029108 A134841 A071112` `Adjacent sequences: A120562 A120563 A120564 this_sequence A120566 A120567 A120568`
	KEYWORD	`nonn`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 14 2006`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research