OFFSET
0,4
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..2500
Index entries for linear recurrences with constant coefficients, signature (2,-2,3,-3,2,-2,1).
FORMULA
Euler transform of length 10 sequence [ 1, 0, 1, 1, 1, 0, 0, 0, 0, -1].
G.f.: (1 + x^5) / ((1 - x) * (1 - x^3) * (1 - x^4)) = (1-x+x^2-x^3+x^4) /( (1+x+x^2) *(1+x^2) *(1-x)^3 ).
a(n) = a(-3-n) for all n in Z.
a(n) = A000933(n+5) for all n>=-2.
a(n) - a(n-1) = A091972(n) for all n in Z.
a(n) - 2*a(n+1) + a(n+2) is a period 12 integer sequence.
a(n) - 2*a(n+1) + 2*a(n+2) - 2*a(n+3) + a(n+4) = 1 if n == 1 (mod 3) else 0.
EXAMPLE
G.f. = 1 + x + x^2 + 2*x^3 + 3*x^4 + 4*x^5 + 5*x^6 + 6*x^7 + 8*x^8 + 10*x^9 + ...
MATHEMATICA
a[ n_] := Ceiling[ (n+1) (n+2) / 12];
PROG
(PARI) {a(n) = ceil( (n+1) * (n+2) / 12)};
(Magma) [Ceiling((n+1)*(n+2)/12): n in [0..60]]; // G. C. Greubel, Aug 04 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Michael Somos, Dec 25 2014
STATUS
approved