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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

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

a(n) = n + Sum_{k=1..n-1} A022907(k), n > 1. [corrected by Sean A. Irvine, May 22 2019]

a(1) = 0; a(n) = (1+3*A033485(2*n-3))/2 = A022905(n-1)+1, n > 1. - Philippe Deléham, May 30 2006

MATHEMATICA

(* b = A022905 *) b[1] = 1; b[n_] := b[n] = b[n-1] + 1 + If[EvenQ[n], 2 b[n/2], b[(n-1)/2] + b[(n+1)/2]];

a[1] = 0; a[n_] := b[n-1] + 1;

Array[a, 50] (* Jean-François Alcover, Nov 11 2018 *)

CROSSREFS

Sequence in context: A139482 A038377 A261227 * A256310 A026390 A005575

Adjacent sequences:  A022905 A022906 A022907 * A022909 A022910 A022911

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 December 7 10:55 EST 2021. Contains 349574 sequences. (Running on oeis4.)