

A235963


n appears (n+1)/(1 + (n mod 2)) times.


6



0, 1, 2, 2, 2, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

Sum_{k=0...a(n)} (1)^ceiling(k/2)*p(nG(k)) = 0 for n>0, where p(n)=A000041(n) is the partition function, and G(k)=A001318(k) denotes the generalized pentagonal numbers.


LINKS



FORMULA

Let t = (sqrt(n*8/3 + 1)  1)/2 + 1/3 and let k = floor(t); then a(n) = 2k if t  k < 2/3, 2k+1 otherwise.  Jon E. Schoenfield, Jun 13 2017


MATHEMATICA

Table[Table[n, {(n + 1)/(1 + Mod[n, 2])}], {n, 0, 14}]//Flatten (* T. D. Noe, Jan 29 2014 *)


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



