login
A167463
a(n) = n mod 15.
2
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13
OFFSET
0,3
LINKS
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
From R. J. Mathar, Jun 28 2011: (Start)
a(n) = a(n-15).
G.f.: -x*(1 +2*x +3*x^2 +4*x^3 +5*x^4 +6*x^5 +7*x^6 +8*x^7 +9*x^8 +10*x^9 +11*x^10 +12*x^11 +13*x^12 +14*x^13) / ( (x-1)*(1+x^4+x^3+x^2+x)*(1+x+x^2)*(1-x+x^3-x^4+x^5-x^7+x^8) ). (End)
MATHEMATICA
Table[Mod[n, 15], {n, 0, 50}] (* G. C. Greubel, Jun 13 2016 *)
CROSSREFS
Sequence in context: A274933 A080331 A297247 * A053835 A072965 A297248
KEYWORD
nonn,easy
AUTHOR
Zerinvary Lajos, Nov 04 2009
STATUS
approved