OFFSET
1,2
REFERENCES
R. K. Guy, "s-Additive sequences", preprint, 1994.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Colin Barker, Table of n, a(n) for n = 1..1000
R. K. Guy, s-Additive sequences, Preprint, 1994. (Annotated scanned copy)
Aayush Rajasekaran, Using Automata Theory to Solve Problems in Additive Number Theory, MS thesis, University of Waterloo, 2018.
Index entries for linear recurrences with constant coefficients, signature (1,0,0,1,-1).
FORMULA
Numbers congruent to {1, 4, 6, 11} mod 12 plus the number 8.
a(n) = a(n-1) + a(n-4) - a(n-5) for n > 7. - Colin Barker, Feb 27 2015
G.f.: x*(2*x^8 + x^6 - x^5 + 2*x^4 + 2*x^3 + 2*x^2 + 3*x + 1) / ((x-1)^2*(x+1)*(x^2+1)). - Colin Barker, Feb 27 2015
MATHEMATICA
Sort[Join[{8}, Select[Range[200], MemberQ[{1, 4, 6, 11}, Mod[#, 12]]&]]] (* Harvey P. Dale, Apr 26 2011 *)
PROG
(PARI) Vec(x*(2*x^8+x^6-x^5+2*x^4+2*x^3+2*x^2+3*x+1)/((x-1)^2*(x+1)*(x^2+1)) + O(x^100)) \\ Colin Barker, Feb 27 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Name clarified by David A. Corneth, Mar 13 2023
STATUS
approved