A366245 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A366245

The largest infinitary divisor of n that is a term of A366243.

1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 4, 1, 1, 1, 1, 1, 9, 1, 4, 1, 1, 1, 4, 25, 1, 9, 4, 1, 1, 1, 1, 1, 1, 1, 36, 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 1, 49, 25, 1, 4, 1, 9, 1, 4, 1, 1, 1, 4, 1, 1, 9, 4, 1, 1, 1, 4, 1, 1, 1, 36, 1, 1, 25, 4, 1, 1, 1, 1, 1, 1, 1, 4, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

COMMENTS

First differs from A335324 at n = 256.

LINKS

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

FORMULA

Multiplicative with a(p^e) = p^A063695(e).

a(n) = n / A366244(n).

a(n) >= 1, with equality if and only if n is a term of A366242.

a(n) <= n, with equality if and only if n is a term of A366243.

MATHEMATICA

f[p_, e_] := p^BitAnd[e, Sum[2^k, {k, 1, Floor@ Log2[e], 2}]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

PROG

(PARI) s(e) = -sum(k = 1, e, (-2)^k*floor(e/2^k));

a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i, 1]^s(f[i, 2])); }

CROSSREFS

Cf. A063695, A335324, A366242, A366243, A366244.

Sequence in context: A131301 A350698 A335324 * A083730 A373440 A358272

Adjacent sequences: A366242 A366243 A366244 * A366246 A366247 A366248

KEYWORD

nonn,easy,mult

AUTHOR

Amiram Eldar, Oct 05 2023

STATUS

approved