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 A235525 #10 Jan 14 2014 11:40:02 %S A235525 486,768,8748,303750,354294,393216,480000,506250,984150,1179648, %T A235525 1228800,1417176,3906250,5467500,6635520,9841500,18750000,24504606, %U A235525 25312500,35156250,47829690,57177414,57395628,83886080,90354432,123018750,153600000,154140672,156243654,201326592,210937500,221433750,245760000,258280326,382637520,460800000,492075000,600000000 %N A235525 Numbers which have identical primes in n and d(n) but are not refactorable. %C A235525 Numbers in A081381 that are not in A033950. %C A235525 Although the set of primes in d(n) and n are identical, there is at least one prime occurring with a higher power in d(n) than in n. %H A235525 Walter Roscello and Giovanni Resta, <a href="/A235525/b235525.txt">Table of n, a(n) for n = 1..100</a> (first 50 terms from Walter Roscello) %e A235525 486 = 2^1 * 3^5 therefore d(486) = 2 * 6 = 2^2 * 3^1 %e A235525 768 = 2^8 * 3^1 therefore d(768) = 9 * 2 = 2^1 * 3^2 %e A235525 Each has the same set of primes in n and d(n) but has too many of one of the primes in d(n) to be refactorable. %t A235525 Select[Range[10^6], Mod[#, t = DivisorSigma[0, #]] > 0 && First /@ FactorInteger[#] == First /@ FactorInteger[t] &] (* _Giovanni Resta_, Jan 11 2014 *) %Y A235525 A000005, A033950, A081381, A235524 %K A235525 nonn %O A235525 1,1 %A A235525 _Walter Roscello_, Jan 11 2014