cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A070441 n^2 mod 19.

Original entry on oeis.org

0, 1, 4, 9, 16, 6, 17, 11, 7, 5, 5, 7, 11, 17, 6, 16, 9, 4, 1, 0, 1, 4, 9, 16, 6, 17, 11, 7, 5, 5, 7, 11, 17, 6, 16, 9, 4, 1, 0, 1, 4, 9, 16, 6, 17, 11, 7, 5, 5, 7, 11, 17, 6, 16, 9, 4, 1, 0, 1, 4, 9, 16, 6, 17, 11, 7, 5, 5, 7, 11, 17, 6, 16, 9, 4, 1, 0, 1, 4, 9, 16, 6, 17, 11, 7, 5, 5, 7, 11
Offset: 0

Views

Author

N. J. A. Sloane, May 12 2002

Keywords

Comments

x^2 - k = 19*y, where x, y and k are integers, has solutions if and only if k mod 19 is an element of {0,1,4,5,6,7,9,11,16,17}. - Vincenzo Librandi, Aug 12 2014

Crossrefs

Programs

Formula

a(n+19) = a(n).
a(19*k - n) = a(n). - Robert Israel, Aug 12 2014