VOOZH about

URL: https://oeis.org/A336302

⇱ A336302 - OEIS

login
A336302
a(n) = n^2 mod ceiling(sqrt(n)).
2
0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 4, 4, 1, 0, 1, 4, 4, 1, 0, 4, 3, 4, 1, 0, 1, 4, 3, 4, 1, 0, 4, 2, 2, 4, 1, 0, 1, 4, 2, 2, 4, 1, 0, 4, 1, 0, 1, 4, 1, 0, 1, 4, 1, 0, 1, 4, 1, 0, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 4, 9, 6, 5, 6, 9, 4, 1, 0, 1, 4, 9, 6, 5, 6, 9, 4, 1, 0, 4, 9, 5, 3, 3, 5, 9, 4
OFFSET
1,17
COMMENTS
A pattern emerges for certain values where ceiling(sqrt(n)) is the same.
LINKS
William Marcum, Desmos graph
FORMULA
a(n) = A000290(n) mod A003059(n). - Michel Marcus, Oct 05 2020
a(n^2) = 0. - Michel Marcus, Oct 07 2020
MATHEMATICA
Table[Mod[n^2, Ceiling @ Sqrt[n]], {n, 100}] (* Amiram Eldar, Oct 05 2020 *)
PROG
(PARI) a(n) = lift(Mod(n, ceil(sqrt(n)))^2); \\ Michel Marcus, Oct 05 2020
CROSSREFS
Sequence in context: A048152 A350037 A070430 * A373428 A163353 A164612
KEYWORD
nonn,easy,look
AUTHOR
STATUS
approved