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,4

Links

Table of n, a(n) for n=1..67.

Index entries for linear recurrences with constant coefficients, signature (1).

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)

Mathematica

Mod[10, Range[100]] (* Paolo Xausa, Nov 14 2023 *)

Crossrefs

Cf. A010692, A010879, A048158, A051127, A090976, A324472.

Sequence in context: A088330 A376252 A347323 * A346576 A122512 A128263

Adjacent sequences: A324468 A324469 A324470 * A324472 A324473 A324474

Keyword

nonn,easy

Author

N. J. A. Sloane, Mar 07 2019, following a suggestion from Charles Kusniec

Status

approved