OFFSET
1,2
COMMENTS
Complement of A016993. - Michel Marcus, Sep 10 2015
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,1,-1).
FORMULA
G.f.: x^2*(2+x+x^2+x^3+x^4+x^5) / ( (1+x)*(1+x+x^2)*(x^2-x+1)*(x-1)^2 ). - R. J. Mathar, Oct 25 2011
From Wesley Ivan Hurt, Sep 10 2015: (Start)
a(n) = a(n-1) + a(n-6) - a(n-7) for n>7.
a(n) = n + floor((n-2)/6). (End)
From Wesley Ivan Hurt, Jun 15 2016: (Start)
a(n) = (42*n-27+3*cos(n*Pi)-12*cos(n*Pi/3)-4*sqrt(3)*sin(2*n*Pi/3))/36.
a(6k) = 7k-1, a(6k-1) = 7k-2, a(6k-2) = 7k-3, a(6k-3) = 7k-4, a(6k-4) = 7k-5, a(6k-5) = 7k-7. (End)
MAPLE
MATHEMATICA
Select[Range[0, 100], MemberQ[{0, 2, 3, 4, 5, 6}, Mod[#, 7]] &] (* Vincenzo Librandi, Oct 22 2014 *)
LinearRecurrence[{1, 0, 0, 0, 0, 1, -1}, {0, 2, 3, 4, 5, 6, 7}, 70] (* Harvey P. Dale, May 28 2018 *)
PROG
(PARI) concat(0, Vec(x^2*(2+x+x^2+x^3+x^4+x^5)/((1+x)*(1+x+x^2)*(x^2-x+1)*(x-1)^2) + O(x^30))) \\ Michel Marcus, Oct 22 2014
(Magma) [n: n in [0..100] | n mod 7 in [0] cat [2..6]]; // Vincenzo Librandi, Oct 22 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
More terms from Michel Marcus, Oct 22 2014
STATUS
approved