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 A335853 #12 Jun 30 2020 05:33:05
%S A335853 1,2,4,8,16,32,64,100,200,400,500,800,1000,2000,4000,5000,8000,10000,
%T A335853 18000,20000,27000,36000,40000,50000,54000,80000,90000,108000,135000,
%U A335853 180000,216000,270000,450000,540000,810000,1080000,1350000,1620000,2160000,2700000
%N A335853 Numbers that are highly powerful in Gaussian integers.
%C A335853 Numbers with a record value of the product of the exponents in the prime factorization in Gaussian integers (A335852). Equivalently, numbers with a record number of powerful divisors in Gaussian integers.
%C A335853 The corresponding record values are 1, 2, 4, 6, 8, 10, 12, 16, 24, 32, 36, 40, 54, 72, 90, 96, ... (see the link for more values).
%H A335853 Amiram Eldar, <a href="/A335853/b335853.txt">Table of n, a(n) for n = 1..81</a>
%H A335853 Amiram Eldar, <a href="/A335853/a335853.txt">Table of n, a(n), A335852(a(n)) for n = 1..81</a>
%e A335853 The factorization of 1, 2, 3 and 4 in Gaussian integers are 1, -i*(1+i)^2, 3 and -(1+i)^4, and the corresponding products of the exponents are 1, 2, 1 and 4. The record values, 1, 2 and 4, occur at 1, 2 and 4 that are the first 3 terms of this sequence.
%t A335853 With[{s = Array[Times @@ FactorInteger[#, GaussianIntegers -> True][[All, -1]] &, 10^5]}, Map[FirstPosition[s, #][[1]] &, Union@FoldList[Max, s]]] (* after _Michael De Vlieger_ at A005934 *)
%Y A335853 Cf. A005934, A279254, A335851, A335852.
%K A335853 nonn
%O A335853 1,2
%A A335853 _Amiram Eldar_, Jun 26 2020