This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022908 The sequence M(n) in A022905. 2
 0, 2, 5, 11, 20, 35, 56, 86, 125, 179, 248, 338, 449, 590, 761, 971, 1220, 1523, 1880, 2306, 2801, 3386, 4061, 4847, 5744, 6782, 7961, 9311, 10832, 12563, 14504, 16694, 19133, 21875, 24920, 28322, 32081, 36266, 40877, 45983, 51584 (list; graph; refs; listen; history; text; 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, arXiv:1606.08033 [math.CO], 2016. FORMULA n + sum(k=1, n-1, A022907(n)), n>1. a(1) = 0; a(n) = (1+3*A033485(2*n-3))/2 = A022905(n-1)+1, n>1 . - Philippe Deléham, May 30 2006 CROSSREFS Sequence in context: A139482 A038377 A261227 * A256310 A026390 A005575 Adjacent sequences:  A022905 A022906 A022907 * A022909 A022910 A022911 KEYWORD nonn AUTHOR 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 22 15:27 EST 2017. Contains 295089 sequences.