login
This site is supported by donations to The OEIS Foundation.
Logo

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

1,2

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

J. M. Dover, On two OEIS conjectures

FORMULA

n + sum(k=2, n, A022907(n)).

a(n+1)=1+3*Sum_{k=1..n}A033485(k). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jun 17 2010]

CROSSREFS

Cf. A022907, A022908.

Sequence in context: A019452 A009890 A015616 * A155368 A155389 A155316

Adjacent sequences:  A022902 A022903 A022904 * A022906 A022907 A022908

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Updated broken URL as proposed by J. Gardiner - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 24 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.