A358253 -id:A358253 - cp's OEIS frontend

A358252 a(n) is the least number with exactly n non-unitary square divisors.

1, 8, 32, 128, 288, 864, 1152, 2592, 4608, 13824, 10368, 20736, 28800, 41472, 64800, 279936, 115200, 331776, 345600, 663552, 259200, 1679616, 518400, 1620000, 1166400, 4860000, 1036800, 17915904, 2073600, 15552000, 6998400, 26873856, 4147200, 53747712, 8294400

Offset: 0

Amiram Eldar, Nov 05 2022

nonn

a(n) is the least number k such that A056626(k) = n.

Since A056626(k) depends only on the prime signature of k, all the terms of this sequence are in A025487.

			a(1) = 8 since 8 is the least number that has exactly one non-unitary square divisor, 4.

Amiram Eldar, Table of n, a(n) for n = 0..176

Cf. A056626, A025487, A358253.

Similar sequences: A005179 (all divisors), A038547 (odd divisors), A085629 (coreful divisors), A130279 (square), A187941 (even), A309181 (non-unitary), A340232 (bi-unitary), A340233 (exponential), A357450 (odd square).

f1[p_, e_] := 1 + Floor[e/2]; f2[p_, e_] := 2^(1 - Mod[e, 2]); f[1] = 0; f[n_] := Times @@ f1 @@@ (fct = FactorInteger[n]) - Times @@ f2 @@@ fct; seq[len_, nmax_] := Module[{s = Table[0, {len}], c = 0, n = 1, i}, While[c < len && n < nmax, i = f[n] + 1; If[i <= len && s[[i]] == 0, c++; s[[i]] = n]; n++]; s]; seq[21, 10^6]

s(n) = {my(f = factor(n)); prod(i = 1, #f~, 1 + floor(f[i,2]/2)) - 2^sum(i = 1, #f~, 1 - f[i,2]%2);}
lista(len, nmax) = {my(v = vector(len), c = 0, n = 1, i); while(c < len && n < nmax, i = s(n) + 1; if(i <= len && v[i] == 0, c++; v[i] = n); n++); v};

A358263 Numbers with a record number of noninfinitary square divisors.

Original entry on oeis.org

1, 16, 144, 256, 1296, 2304, 20736, 57600, 331776, 518400, 2822400, 8294400, 12960000, 25401600, 132710400, 207360000, 228614400, 406425600, 635040000, 2057529600, 3073593600, 6502809600, 10160640000, 27662342400, 31116960000, 51438240000, 76839840000, 248961081600

Offset: 1

Amiram Eldar, Nov 06 2022

nonn

Numbers m such that A358261(m) > A358261(k) for all k < m.

The corresponding record values are 0, 1, 2, 3, 5, 6, 11, 12, 13, 22, 24, 26, 37, 44, 46, 47, 48, ... (see the link for more values).

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

Cf. A358261, A358262.
Subsequence of A025487.
Similar sequences: A002182, A002110 (unitary), A037992 (infinitary), A293185, A306736, A307845, A309141, A318278, A322484, A335386, A348632, A358253.

f1[p_, e_] := 1 + Floor[e/2]; f2[p_, e_] := 2^DigitCount[If[OddQ[e], e - 1, e], 2, 1]; f[1] = 0; f[n_] := Times @@ f1 @@@ (fct = FactorInteger[n]) - Times @@ f2 @@@ fct; s = {}; fmax = -1; Do[If[(fn = f[n]) > fmax, fmax = fn; AppendTo[s, n]], {n, 1, 6*10^5}]; s

s(n) = {my(f = factor(n));  prod(i=1, #f~, 1+f[i,2]\2) - prod(i=1, #f~, 2^hammingweight(if(f[i,2]%2, f[i,2]-1, f[i,2])))};
lista(nmax) = {my(smax = -1, sn); for(n = 1, nmax, sn = s(n); if(sn > smax, smax = sn; print1(n, ", "))); }

cp's OEIS Frontend

A358252 a(n) is the least number with exactly n non-unitary square divisors.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI