A335852 -id:A335852 - cp's OEIS frontend

A335853 Numbers that are highly powerful in Gaussian integers.

1, 2, 4, 8, 16, 32, 64, 100, 200, 400, 500, 800, 1000, 2000, 4000, 5000, 8000, 10000, 18000, 20000, 27000, 36000, 40000, 50000, 54000, 80000, 90000, 108000, 135000, 180000, 216000, 270000, 450000, 540000, 810000, 1080000, 1350000, 1620000, 2160000, 2700000

Offset: 1

Amiram Eldar, Jun 26 2020

nonn

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.

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).

			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.

Amiram Eldar, Table of n, a(n) for n = 1..81
Amiram Eldar, Table of n, a(n), A335852(a(n)) for n = 1..81

Cf. A005934, A279254, A335851, A335852.

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 *)

A376645 The maximum exponent in the factorization of n into powers of Gaussian primes.

Original entry on oeis.org

0, 2, 1, 4, 1, 2, 1, 6, 2, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 6, 2, 2, 3, 4, 1, 2, 1, 10, 1, 2, 1, 4, 1, 2, 1, 6, 1, 2, 1, 4, 2, 2, 1, 8, 2, 2, 1, 4, 1, 3, 1, 6, 1, 2, 1, 4, 1, 2, 2, 12, 1, 2, 1, 4, 1, 2, 1, 6, 1, 2, 2, 4, 1, 2, 1, 8, 4, 2, 1, 4, 1, 2, 1

Offset: 1

Amiram Eldar, Oct 01 2024

a(n) = 0 only for n = 1. a(n) = k occurs infinitely many times for k >= 1. The numbers n = 2^e * m = 2^A007814(n) * A000265(n) for which a(n) = k and their asymptotic density are as follows:
  1. k = 1: n is an odd squarefree number (A056911) and the density is d(1) = 2/(3*zeta(2)) = 0.405284... (A185199).
  2. k >= 3 is odd: e < (k+1)/2 and m is a (k+1)-free number that is not a k-free number: d(k) = (1 - 1/2^((k+1)/2)) * (f(k+1)/zeta(k+1) - f(k)/zeta(k)), where f(k) = 1 - 1/2^k.
  3. k >= 2 is even: e = k/2 and m is a (k+1)-free number, or e < k/2 and m is a (k+1)-free number that is not a k-free number: d(k) = (1/2^(k/2+1)) * f(k+1)/zeta(k+1) + (1-1/2^(k/2)) * (f(k+1)/zeta(k+1) - f(k)/zeta(k)), where f(k) is defined above.
The asymptotic mean of this sequence is Sum_{k>=1} k * d(k) = 2.64836785173193409440576... .

			a(2) = 2 because 2 = -i * (1+i)^2.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Gaussian Prime.
Wikipedia, Gaussian integer: Unique factorization.

Cf. A000265, A051903, A007814, A056911, A078458, A086275, A185199, A335852, A375669.

a[n_] := Max[FactorInteger[n, GaussianIntegers -> True][[;; , 2]]]; a[1] = 0; Array[a, 100]
(* or *)
a[n_] := Module[{e = IntegerExponent[n, 2], od, em}, odd = n / 2^e; Max[2*e, If[odd == 1, 0, Max[FactorInteger[odd][[;;, 2]]]]]]; Array[a, 100]

a(n) = if(n == 1, 0, vecmax(factor(n*I)[, 2]));

a(n) = my(e = valuation(n, 2), es = factor(n >> e)[, 2]); max(2*e, if(#es, vecmax(es), 0));

a(n) = max(2*A007814(n), A051903(A000265(n))) = max(2*A007814(n), A375669(n)).

cp's OEIS Frontend

A335853 Numbers that are highly powerful in Gaussian integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica