A324471 a(n) = 10 mod n.
0, 0, 1, 2, 0, 4, 3, 2, 1, 0, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10
Offset: 1
Links
- Index entries for linear recurrences with constant coefficients, signature (1).
Programs
-
Mathematica
Mod[10,Range[100]] (* Paolo Xausa, Nov 14 2023 *)
Formula
From Elmo R. Oliveira, Aug 03 2024: (Start)
G.f.: x^3*(1 + x - 2*x^2 + 4*x^3 - x^4 - x^5 - x^6 - x^7 + 10*x^8)/(1 - x).
a(n) = 10 for n > 10. (End)