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.
%I A046756 #23 Aug 13 2022 22:25:01 %S A046756 1,625,6561,117649,4100625,31250000,37515625,73530625,771895089, %T A046756 1000000000,2147483648,6442450944,10737418240,15032385536,23622320128, %U A046756 25937424601,27917287424,32212254720,33059881728,36507222016,40802189312,45097156608,49392123904 %N A046756 Numbers k such that d(k)^4 divides k. %C A046756 Proper subset of A033950, A046754 and A046755. Relatively prime terms are in the sequence together with their products like 73530625 or 771895089000000000. %C A046756 2^31 is a term, as is every integer of the form 2^31*p, 2^31*p^3, and 2^31*p*q, where p and q are distinct odd primes; each of these has 32, 64, or 128 divisors. Of the first 10000 terms, 9609 are of one of those forms. Of the remaining 391 terms, 316 are of the form 2^8 * 3^17 * m, where m is 1, a prime > 3, or 5^4. - _Jon E. Schoenfield_, Aug 13 2022 %H A046756 Jon E. Schoenfield, <a href="/A046756/b046756.txt">Table of n, a(n) for n = 1..10000</a> %e A046756 If k=625, d(k) = sigma(0,k) = 5. Its 4th power is 625, which divides k. %t A046756 Select[ Range[ 1, 14500000 ], IntegerQ[ #/(DivisorSigma[ 0, # ])^2 ]& ] %Y A046756 Cf. A033950, A046754, A046755. %K A046756 nonn %O A046756 1,2 %A A046756 _Labos Elemer_ %E A046756 a(6)-a(20) from _Donovan Johnson_, Nov 30 2008 %E A046756 a(21)-a(23) from _Donovan Johnson_, Jun 08 2011