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.

Previous Showing 11-13 of 13 results.

A204917 Least j such that n divides s(k)-s(j) for some k>j, where s(j)=(prime(j))^2.

Original entry on oeis.org

1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 3, 7, 3, 1, 4, 1, 2, 1, 4, 1, 3, 1, 5, 2, 4, 11, 4, 1, 2, 1, 5, 1, 3, 1, 7, 13, 3, 1, 8, 1, 4, 15, 9, 1, 2, 1, 7, 1, 4
Offset: 1

Views

Author

Clark Kimberling, Jan 20 2012

Keywords

Comments

For a guide to related sequences, see A204892.

Crossrefs

Programs

  • Mathematica
    (See the program at A204916.)

A204918 Least prime p^2 such that n divides p^2-q^2 for some prime q satisfying q

Original entry on oeis.org

9, 25, 25, 25, 9, 49, 25, 25, 49, 49, 169, 49, 121, 121, 49, 25, 361, 121, 289, 49, 25, 289, 841, 49, 529, 361, 841, 121, 961, 169, 841, 121, 169, 529, 289, 121, 1849, 961, 121, 49, 1849, 289, 1681, 289, 49, 841, 2809, 121, 2209, 961, 361, 361, 3481
Offset: 1

Views

Author

Clark Kimberling, Jan 20 2012

Keywords

Comments

For a guide to related sequences, see A204892.

Crossrefs

Programs

  • Mathematica
    (See the program at A204916.)

A204920 a(n) = p(n)^2 - q(n)^2, where (p(n)^2, q(n)^2) is the least pair of squared primes for which n divides p(n)^2 - q(n)^2.

Original entry on oeis.org

5, 16, 21, 16, 5, 24, 21, 16, 45, 40, 165, 24, 117, 112, 45, 16, 357, 72, 285, 40, 21, 264, 552, 24, 525, 312, 837, 112, 957, 120, 837, 96, 165, 408, 280, 72, 888, 912, 117, 40, 1845, 168, 1677, 264, 45, 552, 1128, 96, 2205, 600, 357, 312, 1272, 432
Offset: 1

Views

Author

Clark Kimberling, Jan 20 2012

Keywords

Comments

For a guide to related sequences, see A204892.

Crossrefs

Programs

  • Mathematica
    (See the program at A204908.)
Previous Showing 11-13 of 13 results.