# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a335851
Showing 1-1 of 1

%I A335851 #21 May 28 2023 20:49:11
%S A335851 1,2,4,8,9,16,18,25,27,32,36,49,50,54,64,72,81,98,100,108,121,125,128,
%T A335851 144,162,169,196,200,216,225,242,243,250,256,288,289,324,338,343,361,
%U A335851 392,400,432,441,450,484,486,500,512,529,576,578,625,648,675,676,686
%N A335851 Numbers that are powerful in Gaussian integers.
%C A335851 Numbers all of whose prime factors in Gaussian integers have multiplicity larger than 1.
%C A335851 The even powerful numbers divided by 4. - _Amiram Eldar_, May 28 2023
%H A335851 Amiram Eldar, <a href="/A335851/b335851.txt">Table of n, a(n) for n = 1..10000</a>
%H A335851 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GaussianInteger.html">Gaussian Integer</a>.
%H A335851 Wikipedia, <a href="https://en.wikipedia.org/wiki/Gaussian_integer">Gaussian integer</a>.
%F A335851 Sum_{n>=1} 1/a(n) = (4/3) * Sum_{n>=1} 1/A001694(n) = 4*zeta(2)*zeta(3)/(3*zeta(6)) = (4/3) * A082695 = 2.591461...
%e A335851 2 is a term since 2 = -i * (1 + i)^2 in the ring of Gaussian integers. -i is a unit, and the multiplicity of its only Gaussian prime factor, 1 + i, is 2.
%t A335851 gaussPowerQ[n_] := AllTrue[FactorInteger[n, GaussianIntegers -> True], Abs[First[#]] == 1 || Last[#] > 1 &]; Select[Range[1000], gaussPowerQ]
%Y A335851 Disjoint union of A001694 and 2 * A062739.
%Y A335851 Cf. A082695.
%K A335851 nonn
%O A335851 1,2
%A A335851 _Amiram Eldar_, Jun 26 2020

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE