login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022906 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 }. 2
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; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Table of n, a(n) for n=1..81.

CROSSREFS

Cf. A022909, A022910.

Sequence in context: A077869 A076585 A323186 * A285408 A101914 A099530

Adjacent sequences:  A022903 A022904 A022905 * A022907 A022908 A022909

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 12:47 EDT 2021. Contains 348041 sequences. (Running on oeis4.)