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.

A104025 Least number k that can be written as k^2 * j with 0 < j <= k and gcd(k, j) = 1 in n ways.

Original entry on oeis.org

2, 1, 100, 900, 44100, 108900, 1232100, 11492100, 5336100, 12744900, 97416900
Offset: 0

Views

Author

Leroy Quet and Robert G. Wilson v, Feb 23 2005

Keywords

Crossrefs

Programs

  • Mathematica
    t = Sort[ Flatten[ Table[n = k^2*j; If[ GCD[k, j] == 1 && 10^5 < n < 10^8, n, {}], {k, 15000}, {j, k}]]]; l = Length[t]; t[[Select[ Range[l - 11], t[[ # ]] == t[[ # + 9]] &]]]