id:A022905 - OEIS Search Results

Search: id:A022905

Displaying 1-1 of 1 results found.

page 1

a(n) = M(n) + m(n) for n >= 2, where M(n) = max{ a(i) + a(n-i): i = 1..n-1 }, m(n) = min{ a(i) + a(n-i): i = 1..n-1 }.

+0
4

1, 4, 10, 19, 34, 55, 85, 124, 178, 247, 337, 448, 589, 760, 970, 1219, 1522, 1879, 2305, 2800, 3385, 4060, 4846, 5743, 6781, 7960, 9310, 10831, 12562, 14503, 16693, 19132, 21874, 24919, 28321, 32080, 36265, 40876, 45982, 51583, 57769 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`J. M. Dover, On two OEIS conjectures`
	FORMULA	`n + sum(k=2, n, A022907(n)).`
	CROSSREFS	`Cf. A022907, A022908.` `Sequence in context: A019452 A009890 A015616 this_sequence A155368 A155389 A155316` `Adjacent sequences: A022902 A022903 A022904 this_sequence A022906 A022907 A022908`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 25 14:49 EST 2009. Contains 167514 sequences.

AT&T Labs Research