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 A061236 #16 Jan 23 2025 12:44:37
%S A061236 24,900,810000,729000000,590490000000000,531441000000000000,
%T A061236 430467210000000000000000,387420489000000000000000000,
%U A061236 313810596090000000000000000000000,228767924549610000000000000000000000000000,205891132094649000000000000000000000000000000
%N A061236 Smallest number with prime(n)^3 divisors where prime(n) is n-th prime.
%H A061236 Amiram Eldar, <a href="/A061236/b061236.txt">Table of n, a(n) for n = 1..123</a>
%F A061236 For p = 2, 24 is the solution. If a prime p > 2, the suitable powers of 30 are the least solutions: a(n) = Min{x | d(x) = A000005(x) = p(n)^3} = 30^(prime(n)-1). d(2^(ppp-1)) = d(2^(pp-1)*3^(p-1)) = d(30^(p-1)) = p^3 and 2^(ppp-1) > 2^(pp-1)*3^(p-1) > 30^(p-1) holds if p > 2.
%F A061236 a(n) = A005179(A030078(n)) = A005179(prime(n)^3). - _Amiram Eldar_, Jan 23 2025
%e A061236 If p = 2, then d(128) = d(24) = d(30) = 8 and a(1) = 24 < 30 is the smallest.
%e A061236 If p = 5, then 2^124 > (2^24)*(3^4) > 30^4 = 810000 = a(3).
%Y A061236 Cf. A000005, A005179, A003680, A030078, A037992, A061283, A061286, A061148, A061149, A061234.
%K A061236 nonn
%O A061236 1,1
%A A061236 _Labos Elemer_, Jun 01 2001
%E A061236 a(10)-a(11) from _Amiram Eldar_, Jan 23 2025