id:A022906 - OEIS Search Results

Search: id:A022906

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
3

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

	OFFSET	`1,5`
	CROSSREFS	`Cf. A022909, A022910.` `Sequence in context: A099028 A077869 A076585 this_sequence A101914 A099530 A167544` `Adjacent sequences: A022903 A022904 A022905 this_sequence A022907 A022908 A022909`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research