OFFSET
1,1
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
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Steven R. Finch, Are 0-Additive Sequences Always Regular?, Am. Math. Monthly 99 (7) (1992) 671-673.
R. K. Guy, s-Additive sequences, Preprint, 1994. (Annotated scanned copy)
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,1,-1).
FORMULA
The numbers 2, 5, 6, 9, 13 mod 15, plus the number 10. - Ralf Stephan, Mar 28 2004
G.f.: x*(x^10 +2*x^9 -2*x^8 +2*x^7 +x^6 +x^5 +x^4 +3*x^3 +x^2 +3*x +2) / ((x -1)^2*(x^4 +x^3 +x^2 +x +1)). - Colin Barker, Jul 09 2014
MATHEMATICA
Sort[Join[{10}, Flatten[Table[15*n+{2, 5, 6, 9, 13}, {n, 0, 12}]]]] (* Harvey P. Dale, Jul 12 2012 *)
CoefficientList[Series[(x^10 + 2*x^9 - 2 x^8 + 2 x^7 + x^6 + x^5 + x^4 + 3 x^3 + x^2 + 3 x + 2)/((x - 1)^2 (x^4 + x^3 + x^2 + x + 1)), {x, 0, 50}], x] (* Vincenzo Librandi, Jul 10 2014 *)
PROG
(PARI) Vec(x*(x^10+2*x^9-2*x^8+2*x^7+x^6+x^5+x^4+3*x^3+x^2+3*x+2)/((x-1)^2*(x^4+x^3+x^2+x+1)) + O(x^100)) \\ Colin Barker, Jul 09 2014
(Magma) I:=[2, 5, 6, 9, 10, 13, 17, 20, 21, 24, 28]; [n le 11 select I[n] else Self(n-1)+Self(n-5)-Self(n-6): n in [1..60]]; // Vincenzo Librandi, Jul 10 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved