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 A377846 #9 Nov 10 2024 05:38:48
%S A377846 1,4,8,9,16,25,27,32,36,49,64,72,81,100,108,121,125,128,144,169,196,
%T A377846 200,225,243,256,288,289,324,343,361,392,400,441,484,500,512,529,576,
%U A377846 625,675,676,729,784,800,841,900,961,968,972,1024,1089,1125,1152,1156,1225
%N A377846 Powerful numbers that are not divisible by the cubes of more than one distinct prime.
%C A377846 Subsequence of A377821 and first differs from it at n = 33: A377821(33) = 432 = 2^4 * 3^3 is not a term of this sequence.
%C A377846 Numbers whose prime factorization has exponents that are all larger than 1 and no more than one exponent is larger than 2.
%H A377846 Amiram Eldar, <a href="/A377846/b377846.txt">Table of n, a(n) for n = 1..10000</a>
%H A377846 <a href="/index/Pow#powerful">Index entries for sequences related to powerful numbers</a>.
%F A377846 Sum_{n>=1} 1/a(n) = (15/Pi^2) * (1 + Sum_{p prime} 1/((p-1)*(p^2+1))) = 1.92240214785252516795... .
%t A377846 q[n_] := Module[{e = Sort[FactorInteger[n][[;; , 2]]]}, Length[e] == 1 || e[[-2]] == 2]; With[{max = 1300}, Select[Union@ Flatten@ Table[i^2 * j^3, {j, 1, max^(1/3)}, {i, 1, Sqrt[max/j^3]}], # == 1 || q[#] &]]
%o A377846 (PARI) is(k) = if(k == 1, 1, my(e = vecsort(factor(k)[, 2])); e[1] > 1 && (#e == 1 || e[#e - 1] == 2));
%Y A377846 Complement of A376936 within A001694.
%Y A377846 Subsequence of A377821.
%Y A377846 Subsequences: A143610, A377847.
%Y A377846 Cf. A082020.
%K A377846 nonn,easy
%O A377846 1,2
%A A377846 _Amiram Eldar_, Nov 09 2024