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.

Showing 1-7 of 7 results.

A070456 a(n) = n^2 mod 34.

Original entry on oeis.org

0, 1, 4, 9, 16, 25, 2, 15, 30, 13, 32, 19, 8, 33, 26, 21, 18, 17, 18, 21, 26, 33, 8, 19, 32, 13, 30, 15, 2, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 2, 15, 30, 13, 32, 19, 8, 33, 26, 21, 18, 17, 18, 21, 26, 33, 8, 19, 32, 13, 30, 15, 2, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 2, 15, 30
Offset: 0

Views

Author

N. J. A. Sloane, May 12 2002

Keywords

Crossrefs

Programs

Formula

a(n) = a(n-34). - G. C. Greubel, Mar 25 2016

A070457 a(n) = n^2 mod 35.

Original entry on oeis.org

0, 1, 4, 9, 16, 25, 1, 14, 29, 11, 30, 16, 4, 29, 21, 15, 11, 9, 9, 11, 15, 21, 29, 4, 16, 30, 11, 29, 14, 1, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 1, 14, 29, 11, 30, 16, 4, 29, 21, 15, 11, 9, 9, 11, 15, 21, 29, 4, 16, 30, 11, 29, 14, 1, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 1, 14, 29, 11
Offset: 0

Views

Author

N. J. A. Sloane, May 12 2002

Keywords

Crossrefs

Programs

Formula

a(n) = a(n-35). - G. C. Greubel, Mar 25 2016

A070453 a(n) = n^2 mod 31.

Original entry on oeis.org

0, 1, 4, 9, 16, 25, 5, 18, 2, 19, 7, 28, 20, 14, 10, 8, 8, 10, 14, 20, 28, 7, 19, 2, 18, 5, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 5, 18, 2, 19, 7, 28, 20, 14, 10, 8, 8, 10, 14, 20, 28, 7, 19, 2, 18, 5, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 5, 18, 2, 19, 7, 28, 20, 14, 10, 8, 8, 10, 14, 20
Offset: 0

Views

Author

N. J. A. Sloane, May 12 2002

Keywords

Crossrefs

Programs

Formula

a(n) = a(n-31). - G. C. Greubel, Mar 24 2016

A010391 Squares mod 29.

Original entry on oeis.org

0, 1, 4, 5, 6, 7, 9, 13, 16, 20, 22, 23, 24, 25, 28
Offset: 1

Views

Author

Keywords

Comments

A070451 sorted, duplicates removed. - R. J. Mathar, Jan 12 2024

Crossrefs

Programs

A070454 a(n) = n^2 mod 32.

Original entry on oeis.org

0, 1, 4, 9, 16, 25, 4, 17, 0, 17, 4, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 4, 17, 0, 17, 4, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 4, 17, 0, 17, 4, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 4, 17, 0, 17, 4, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 4, 17, 0, 17, 4, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 4, 17
Offset: 0

Views

Author

N. J. A. Sloane, May 12 2002

Keywords

Crossrefs

Programs

Formula

a(n) = a(n-16). - G. C. Greubel, Mar 24 2016

A070455 a(n) = n^2 mod 33.

Original entry on oeis.org

0, 1, 4, 9, 16, 25, 3, 16, 31, 15, 1, 22, 12, 4, 31, 27, 25, 25, 27, 31, 4, 12, 22, 1, 15, 31, 16, 3, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 3, 16, 31, 15, 1, 22, 12, 4, 31, 27, 25, 25, 27, 31, 4, 12, 22, 1, 15, 31, 16, 3, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 3, 16, 31, 15, 1, 22, 12, 4
Offset: 0

Views

Author

N. J. A. Sloane, May 12 2002

Keywords

Crossrefs

Programs

Formula

a(n) = a(n-33). - G. C. Greubel, Mar 24 2016

A096459 Triangle read by rows: T(n,k) = n^2 mod prime(k), 1<=k<=n.

Original entry on oeis.org

1, 0, 1, 1, 0, 4, 0, 1, 1, 2, 1, 1, 0, 4, 3, 0, 0, 1, 1, 3, 10, 1, 1, 4, 0, 5, 10, 15, 0, 1, 4, 1, 9, 12, 13, 7, 1, 0, 1, 4, 4, 3, 13, 5, 12, 0, 1, 0, 2, 1, 9, 15, 5, 8, 13, 1, 1, 1, 2, 0, 4, 2, 7, 6, 5, 28, 0, 0, 4, 4, 1, 1, 8, 11, 6, 28, 20, 33, 1, 1, 4, 1, 4, 0, 16, 17, 8, 24, 14, 21, 5, 0, 1, 1, 0
Offset: 1

Views

Author

Reinhard Zumkeller, Aug 12 2004

Keywords

Comments

T(n,k)=0 iff k is a prime factor of n:
A001221(n) = number of zeros in n-th row;
T(n,1)=A000035(n);
T(n,2)=A011655(n) for n>1; T(n,3)=A070430(n) for n>2;
T(n,4)=A053879(n) for n>3; T(n,5)=A070434(n) for n>4;
T(n,6)=A070436(n) for n>5; T(n,7)=A054580(n) for n>6;
T(n,8)=A070441(n) for n>7; T(n,9)=A070445(n) for n>8;
T(n,10)=A070451(n) for n>9;
T(n,n)=A069547(n).

Examples

			Triangle begins:
1;
0, 1;
1, 0, 4;
0, 1, 1, 2;
1, 1, 0, 4, 3;
0, 0, 1, 1, 3, 10;
1, 1, 4, 0, 5, 10, 15;
......
		

Crossrefs

Programs

  • Mathematica
    Table[Mod[n^2, Prime[k]], {n, 1, 10}, {k, 1, n}] (* G. C. Greubel, May 20 2017 *)
Showing 1-7 of 7 results.