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 A377847 #12 Mar 31 2025 01:45:36
%S A377847 8,16,27,32,64,72,81,108,125,128,144,200,243,256,288,324,343,392,400,
%T A377847 500,512,576,625,675,729,784,800,968,972,1024,1125,1152,1323,1331,
%U A377847 1352,1372,1568,1600,1800,1936,2025,2048,2187,2197,2304,2312,2401,2500,2700,2704,2888,2916
%N A377847 Powerful numbers that are divisible by the cube of a single prime.
%C A377847 Numbers whose prime factorization contains one exponent that equals 3, and all the others, if they exist, are equal to 2.
%H A377847 Amiram Eldar, <a href="/A377847/b377847.txt">Table of n, a(n) for n = 1..10000</a>
%H A377847 <a href="/index/Pow#powerful">Index entries for sequences related to powerful numbers</a>.
%F A377847 Sum_{n>=1} 1/a(n) = (15/Pi^2) * Sum_{p prime} 1/((p-1)*(p^2+1)) = 0.40258439321745859629... .
%t A377847 q[n_] := Module[{e = Sort[FactorInteger[n][[;; , 2]]]}, e[[-1]] > 2 && (Length[e] == 1 || e[[-2]] == 2)]; With[{max = 3000}, Select[Union@ Flatten@Table[i^2 * j^3, {j, 1, max^(1/3)}, {i, 1, Sqrt[max/j^3]}], q]]
%o A377847 (PARI) is(k) = if(k == 1, 0, my(e = vecsort(factor(k)[, 2])); e[1] > 1 && e[#e] > 2 && (#e == 1 || e[#e - 1] == 2));
%Y A377847 Subsequence of A001694, A320966 and A377846.
%Y A377847 A030078 is a subsequence.
%Y A377847 Cf. A082020.
%K A377847 nonn,easy
%O A377847 1,1
%A A377847 _Amiram Eldar_, Nov 09 2024