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.

This page as a plain text file.
%I A104025 #9 Dec 24 2015 23:07:36
%S A104025 2,1,100,900,44100,108900,1232100,11492100,5336100,12744900,97416900
%N A104025 Least number k that can be written as k^2 * j with 0 < j <= k and gcd(k, j) = 1 in n ways.
%t A104025 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]] &]]]
%Y A104025 Cf. A102354, A104021, A104023.
%K A104025 nonn
%O A104025 0,1
%A A104025 _Leroy Quet_ and _Robert G. Wilson v_, Feb 23 2005