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 A262675 #46 Dec 01 2023 15:53:01
%S A262675 1,8,27,32,64,125,216,243,343,512,729,864,1000,1024,1331,1728,1944,
%T A262675 2197,2744,3125,3375,4000,4096,4913,5832,6859,7776,8000,9261,10648,
%U A262675 10976,12167,13824,15552,15625,16807,17576,19683,21952,23328,24389,25000,27000,27648,29791
%N A262675 Exponentially evil numbers.
%C A262675 Or the numbers whose prime power factorization contains primes only in evil exponents (A001969): 0, 3, 5, 6, 9, 10, 12, ...
%C A262675 If n is in the sequence, then n^2 is also in the sequence.
%C A262675 A268385 maps each term of this sequence to a unique nonzero square (A000290), and vice versa. - _Antti Karttunen_, May 26 2016
%H A262675 Amiram Eldar, <a href="/A262675/b262675.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Reinhard Zumkeller)
%F A262675 Product_{k=1..A001221(n)} A010059(A124010(n,k)) = 1. - _Reinhard Zumkeller_, Oct 25 2015
%F A262675 Sum_{n>=1} 1/a(n) = Product_{p prime} (1 + Sum_{k>=2} 1/p^A001969(k)) = Product_{p prime} f(1/p) = 1.2413599378..., where f(x) = (1/(1-x) + Product_{k>=0} (1 - x^(2^k)))/2. - _Amiram Eldar_, May 18 2023, Dec 01 2023
%e A262675 864 = 2^5*3^3; since 5 and 3 are evil numbers, 864 is in the sequence.
%t A262675 {1}~Join~Select[Range@ 30000, AllTrue[Last /@ FactorInteger[#], EvenQ@ First@ DigitCount[#, 2] &] &] (* _Michael De Vlieger_, Sep 27 2015, Version 10 *)
%t A262675 expEvilQ[n_] := n == 1 || AllTrue[FactorInteger[n][[;; , 2]], EvenQ[DigitCount[#, 2, 1]] &]; With[{max = 30000}, Select[Union[Flatten[Table[i^2*j^3, {j, Surd[max, 3]}, {i, Sqrt[max/j^3]}]]], expEvilQ]] (* _Amiram Eldar_, Dec 01 2023 *)
%o A262675 (PARI) isok(n) = {my(f = factor(n)); for (i=1, #f~, if (hammingweight(f[i,2]) % 2, return (0));); return (1);} \\ _Michel Marcus_, Sep 27 2015
%o A262675 (Haskell)
%o A262675 a262675 n = a262675_list !! (n-1)
%o A262675 a262675_list = filter
%o A262675 (all (== 1) . map (a010059 . fromIntegral) . a124010_row) [1..]
%o A262675 -- _Reinhard Zumkeller_, Oct 25 2015
%o A262675 (Perl) use ntheory ":all"; sub isok { my @f = factor_exp($_[0]); return scalar(grep { !(hammingweight($_->[1]) % 2) } @f) == @f; } # _Dana Jacobsen_, Oct 26 2015
%Y A262675 Subsequence of A036966.
%Y A262675 Apart from 1, a subsequence of A270421.
%Y A262675 Indices of ones in A270418.
%Y A262675 Sequence A270437 sorted into ascending order.
%Y A262675 Cf. A001969, A209061, A138302, A197680, A000578, A000584, A001014, A001017, A008456, A010803, A010805, A010806, A010808, A010811, A010812, A001221, A010059, A124010, A268385, A270428.
%K A262675 nonn,base
%O A262675 1,2
%A A262675 _Vladimir Shevelev_, Sep 27 2015
%E A262675 More terms from _Michel Marcus_, Sep 27 2015