login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A324472
a(n) = 1000 mod n.
2
0, 0, 1, 0, 0, 4, 6, 0, 1, 0, 10, 4, 12, 6, 10, 8, 14, 10, 12, 0, 13, 10, 11, 16, 0, 12, 1, 20, 14, 10, 8, 8, 10, 14, 20, 28, 1, 12, 25, 0, 16, 34, 11, 32, 10, 34, 13, 40, 20, 0, 31, 12, 46, 28, 10, 48, 31, 14, 56, 40, 24, 8, 55, 40, 25, 10, 62, 48, 34, 20, 6, 64, 51, 38, 25, 12, 76
OFFSET
1,6
FORMULA
a(n) = 1000 for n >= 1001.
a(n) = 0 <=> n in { A018767 }.
a(n) = 1 <=> n > 1 and n in { A018766 }.
EXAMPLE
a(98) = 1000 mod 98 = 20 as 1000 = 98 * 10 + 20. - David A. Corneth, Mar 07 2019
MATHEMATICA
Mod[1000, Range[100]] (* Paolo Xausa, Nov 14 2023 *)
PROG
(PARI) a(n) = 1000 % n \\ David A. Corneth, Mar 07 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Mar 07 2019, following a suggestion from Charles Kusniec.
STATUS
approved