A082020 -id:A082020 - cp's OEIS frontend

A378900 Squares of numbers divisible by the squares of two distinct primes.

1296, 5184, 10000, 11664, 20736, 32400, 38416, 40000, 46656, 50625, 63504, 82944, 90000, 104976, 129600, 153664, 156816, 160000, 186624, 194481, 202500, 219024, 234256, 250000, 254016, 291600, 331776, 345744, 360000, 374544, 419904, 455625, 456976, 467856, 490000

Offset: 1

Michael De Vlieger, Dec 12 2024

Also, the squares in A376936.
Proper subset of A378767, in turn a proper subset of A286708, the intersection of A001694 and A024619.
Numbers that have 3 kinds of coreful divisor pairs (d, k/d), d | k, i.e., rad(d) = rad(k/d) = rad(k) where rad = A007947. These kinds are described as follows:
Type A: d = k/d, which pertain to square k (in A000290).
Type B: d | k/d, d < k/d, which pertain to k in A320966, powerful numbers divisible by a cube.
Type C: neither d | k/d nor k/d | d, which pertain to k in A376936.
Since divisors d, k/d may either divide or not divide the other, there are no other cases.
In addition the following kinds of divisor pairs are also seen:
Type D: (d, k/d) such that d | k/d but there exists a factor Q | k/d that does not divide d. Then omega(d) < omega(k/d) = omega(k).
Type E: Nontrivial unitary divisor pairs (d, k/d) such that gcd(d, k/d) = 1, d > 1, k/d > 1. Let prime power factor p^m | k be such that m is maximized. Then set d = p^m and it is clear that for any k in A024619, there exists at least 1 nontrivial unitary divisor pair.

			Let b = A036785.
Table of the first 12 terms of this sequence, showing examples of types A, B, and C of coreful pairs of divisors.
   n    a(n)   Factors of a(n)    b(n)   Type B       Type C
  -------------------------------------------------------------
   1    1296   2^4  * 3^4          36    6 * 216      24 * 54
   2    5184   2^6  * 3^4          72    6 * 864      48 * 108
   3   10000   2^4  * 5^4         100   10 * 1000     40 * 250
   4   11664   2^4  * 3^6         108    6 * 1944     24 * 486
   5   20736   2^8  * 3^4         144    6 * 3456     54 * 384
   6   32400   2^4  * 3^4 * 5^2   180   30 * 1080    120 * 270
   7   38416   2^4  * 7^4         196   14 * 2744     56 * 686
   8   40000   2^6  * 5^4         200   10 * 4000     80 * 500
   9   46656   2^6  * 3^6         216    6 * 7776     48 * 972
  10   50625   3^4  * 5^4         225   15 * 3375    135 * 375
  11   63504   2^4  * 3^4 * 7^2   252   42 * 1512    168 * 378
  12   82944   2^10 * 3^4         288    6 * 13824    54 * 1536

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Michael De Vlieger, Listing of select divisor pairs of a(n), n = 1..12, showing divisor pairs of type A in light gray, type B in orange and purple, and type C in black.

Cf. A000290, A001694, A007947, A024619, A036785, A126706, A286708, A320966, A376936, A378768.

Cf. A013661, A082020.

s = Union@ Select[Flatten@ Table[a^2*b^3, {b, Surd[#, 3]}, {a, Sqrt[#/b^3]}],   IntegerQ@ Sqrt[#] &] &[500000];
Union@ Select[s, Length@ Select[FactorInteger[#][[All, -1]], # > 2 &] >= 2 &]

a(n) = A036785(n)^2.

Sum_{n>=1} 1/a(n) = Pi^2/6 - (15/Pi^2) * (1 + Sum_{p prime} 1/(p^4-1)) = 0.0015294876575980711757... . - Amiram Eldar, Dec 21 2024

A378984 Squares in A378769.

Original entry on oeis.org

32400, 63504, 90000, 129600, 156816, 202500, 219024, 254016, 291600, 345744, 360000, 374544, 467856, 490000, 518400, 571536, 627264, 685584, 777924, 810000, 876096, 960400, 1016064, 1089936, 1166400, 1210000, 1245456, 1382976, 1411344, 1440000, 1498176, 1587600

Offset: 1

Michael De Vlieger, Dec 15 2024

Let omega = A001221, bigomega = A001222, and rad = A007947.
Numbers k that have all types of divisor pairs (d, k/d), d | k, that are listed in both A378769 and A378900. These are listed below:
Type A*: (Nontrivial) unitary divisor pairs, i.e., d coprime to k/d. The rest of the types are in cototient.
Type B*: gcd(d, k/d) > 1, rad(d) !| k/d, rad(k/d) !| d. These exist for k in A375055.
Type C: d < k/d, d | k/d but rad(k/d) !| d. Implies rad(k/d) = rad(k) and omega(d) < omega(k/d). These exist for k in A126706.
Type D: Either rad(d) | k/d, rad(k/d) !| d or vice versa. These exist for k in A378767.
Type E*: d = k/d = sqrt(k).
Type F: rad(d) = rad(k/d) = rad(k), d < k/d, d | k/d. These exist for k in A320966.
Type G*: rad(d) = rad(k/d) = rad(k), neither d | k/d nor k/d | d. These exist for k in A376936.
Asterisks denote symmetric types.
Since numbers d and k/d are either coprime or not, and if not, the squarefree kernel of one either divides the other or not, and if so, d divides k/d or not, and if so, d = k/d or not, there are no other types.
Smallest odd term is a(45) = 2480625.
Square roots not A350372: sqrt(810000) = 900 is not in A350372.

			a(1) = 32400 = 2^4 * 3^4 * 5^2 has the following divisor pair types:
  Type A: 16 * 2025, Type B: 48 * 675, Type C: 2 * 16200, Type D: 8 * 4050
  Type E: 180 * 180, Type F: 30 * 1080, Type G: 120 * 270.
a(2) = 63504 = 2^4 * 3^4 * 7^2 has the following divisor pair types:
  Type A: 16 * 3969, Type B: 48 * 1323, Type C: 2 * 31752, Type D: 8 * 7938
  Type E: 252 * 252, Type F: 42 * 1512, Type G: 168 * 378.
a(3) = 90000 = 2^4 * 3^2 * 5^4 has the following divisor pair types:
  Type A: 9 * 10000, Type B: 18 * 5000, Type C: 2 * 45000, Type D: 8 * 11250
  Type E: 300 * 300, Type F: 30 * 3000, Type G: 120 * 750, etc.

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Michael De Vlieger, Diagram listing all divisor pairs for a(n), n = 1..8, showing type A in white, type B in light gray, type C in green or red, type D in blue or gold, type E in dark gray, type F in orange or purple, and type G in black.
Michael De Vlieger, Diagram listing divisor pairs (d, k/d) for k = a(n), n = 1..60, showing only those with the smallest d and using the same color scheme as above, for each type and its reversal if the type is nonsymmetric.

Cf. A000290, A001221, A001222, A007947, A126706, A320966, A350372, A375055, A376936, A378767, A378769, A378900.

Cf. A013661, A082020.

s = Union@ Select[Flatten@ Table[a^2*b^3, {b, Surd[#, 3]}, {a, Sqrt[#/b^3]}] &[2^21],  IntegerQ@ Sqrt[#] &];
t = Select[s, Length@ Select[FactorInteger[#][[All, -1]], # > 2 &] >= 2 &];
Select[t, PrimeOmega[#] > PrimeNu[#] > 2 &]

This sequence is { k = s^2 : rad(k)^2 | k,
  bigomega(k) > omega(k) > 2, p^3 | k and q^3 | k for distinct primes p, q }.
Intersection of A378769 and A378900.
Intersection of A000290, A375055, and A376936.
Sum_{n>=1} = Pi^2/6 - (15/Pi^2) * (1 + Sum_{p prime} (1/(p^4-1))) - ((Sum_{p prime} (1/(p^2*(p^2-1))))^2 - Sum_{p prime} (1/(p^4*(p^2-1)^2)))/2 = 0.00015490158528995570146... . - Amiram Eldar, Dec 21 2024

A157294 Decimal expansion of 1575/Pi^6.

Original entry on oeis.org

1, 6, 3, 8, 2, 5, 4, 3, 2, 0, 4, 4, 0, 9, 6, 7, 3, 6, 6, 3, 4, 1, 4, 9, 4, 2, 7, 4, 9, 8, 9, 8, 7, 3, 5, 5, 4, 9, 1, 8, 7, 0, 2, 5, 2, 6, 6, 4, 4, 3, 4, 4, 7, 1, 8, 0, 7, 2, 9, 0, 0, 6, 7, 4, 8, 9, 2, 5, 0, 4, 2, 3, 5, 5, 7, 4, 4, 7, 9, 0, 4, 1, 3, 4, 8, 3, 1, 5, 9, 2, 4, 6, 3, 0, 4, 9, 2, 3, 6, 9, 2, 5, 6, 9, 1

Offset: 1

R. J. Mathar, Feb 26 2009

Equals the asymptotic mean of the abundancy index of the 7-free numbers (numbers that are not divisible by a 7th power other than 1) (Jakimczuk and Lalín, 2022). - Amiram Eldar, May 12 2023

			1.63825432044096736634149427498... = (1+1/2^2+1/2^4+1/2^6)*(1+1/3^2+1/3^4+1/3^6)*(1+1/5^2+1/5^4+1/5^6)*(1+1/7^2+1/7^4+1/7^6)*...

Rafael Jakimczuk and Matilde Lalín, Asymptotics of sums of divisor functions over sequences with restricted factorization structure, Notes on Number Theory and Discrete Mathematics, Vol. 28, No. 4 (2022), pp. 617-634, eq. (1).
Index entries for transcendental numbers.

Cf. A001248, A030514, A030516, A082020, A013661, A013666, A092746, A157290.

Maple
```
evalf(1575/Pi^6) ;
```

RealDigits[1575/Pi^6,10,120][[1]] (* Harvey P. Dale, May 26 2019 *)

1575/Pi^6 \\ Charles R Greathouse IV, Oct 01 2022

Equals Product_{p = primes = A000040} (1+1/p^2+1/p^4+1/p^6).

Equals A013661/A013666 = A082020*A157290 = Product_{i>=1} (1+1/A001248(i)+1/A030514(i)+1/A030516(i)) = 1575*A092746.

A157296 Decimal expansion of 31185/(2*Pi^8).

Original entry on oeis.org

1, 6, 4, 3, 2, 9, 9, 6, 8, 1, 8, 5, 7, 0, 9, 9, 9, 9, 2, 2, 7, 7, 4, 8, 0, 1, 8, 0, 1, 2, 9, 1, 4, 9, 7, 8, 4, 6, 0, 8, 2, 8, 7, 5, 8, 4, 4, 5, 7, 2, 3, 5, 0, 9, 8, 5, 9, 5, 8, 3, 4, 5, 0, 5, 1, 6, 4, 3, 2, 8, 6, 4, 8, 1, 2, 4, 5, 5, 1, 7, 4, 9, 5, 3, 7, 5, 1, 3, 7, 4, 2, 3, 7, 6, 5, 4, 9, 2, 9, 5, 6, 5, 8, 2, 8

Offset: 1

R. J. Mathar, Feb 26 2009

Equals the asymptotic mean of the abundancy index of the 9-free numbers (numbers that are not divisible by a 9th power other than 1) (Jakimczuk and Lalín, 2022). - Amiram Eldar, May 12 2023

			1.64329968185709999227... = (1+1/2^2+1/2^4+1/2^6+1/2^8)*(1+1/3^2+1/3^4+1/3^6+1/3^8)*(1+1/5^2+1/5^4+1/5^6+1/5^8)*...

Rafael Jakimczuk and Matilde Lalín, Asymptotics of sums of divisor functions over sequences with restricted factorization structure, Notes on Number Theory and Discrete Mathematics, Vol. 28, No. 4 (2022), pp. 617-634, eq. (1).
Index entries for transcendental numbers.

Cf. A001248, A030514, A030514, A030516, A082020, A013661, A013668, A092748.

Maple
```
evalf(31185/2/Pi^8) ;
```

RealDigits[31185/(2*Pi^8),10,120][[1]] (* Harvey P. Dale, Mar 30 2018 *)

31185/2/Pi^8 \\ Charles R Greathouse IV, Oct 01 2022

Equals Product_{p = primes = A000040} (1+1/p^2+1/p^4+1/p^6+1/p^8). The variant Product_{p} (1+1/p^2+1/p^6+1/p^8) equals A082020*Product_{p} (1+1/p^6) = A082020*zeta(6)/zeta(12) = 10135125/(691*Pi^8).

Equals A013661/A013668 = Product_{i>=1} (1+1/A001248(i)+1/A030514(i)+1/A030516(i)+1/A030514(i)^2) = 15592.5*A092748.

A269404 Decimal expansion of Product_{k >= 1} (1 + 1/prime(k)^6).

Original entry on oeis.org

1, 0, 1, 7, 0, 9, 2, 7, 6, 9, 1, 3, 0, 4, 9, 9, 2, 7, 6, 6, 4, 3, 2, 7, 2, 1, 3, 3, 0, 9, 7, 9, 0, 9, 9, 2, 0, 4, 9, 2, 2, 1, 9, 0, 7, 9, 4, 9, 4, 1, 0, 1, 1, 3, 4, 6, 6, 4, 6, 5, 1, 7, 9, 3, 8, 1, 8, 9, 3, 5, 3, 3, 5, 8, 3, 4, 2, 2, 7, 9, 4, 3, 1, 8, 1, 5, 1, 5, 9, 6, 4, 7, 8, 5, 0, 6, 6, 8, 9, 7, 8, 4, 5, 4, 6, 5, 1, 0, 6, 4, 0, 2, 6, 1, 3, 3, 6, 9, 3, 0

Offset: 1

Ilya Gutkovskiy, Feb 25 2016

More generally, Product_{k >= 1} (1 + 1/prime(k)^m) = zeta(m)/zeta(2*m), where zeta(m) is the Riemann zeta function.

			1.0170927691304992766432721330979099204922190794941...

Eric Weisstein's World of Mathematics, Prime Products.

Cf. A005117, A082020, A113851, A157289, A157290, A157291.

RealDigits[Zeta[6]/Zeta[12], 10, 120][[1]]
RealDigits[675675/(691 Pi^6), 10, 120][[1]]

zeta(6)/zeta(12) \\ Amiram Eldar, Jun 11 2023

Equals zeta(6)/zeta(12).
Equals 675675/(691*Pi^6).
Equals Sum_{k>=1} 1/A005117(k)^6 = 1 + Sum_{k>=1} 1/A113851(k). - Amiram Eldar, Jun 27 2020

A362854 The sum of the divisors of n that are both bi-unitary and exponential.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 10, 9, 10, 11, 12, 13, 14, 15, 18, 17, 18, 19, 20, 21, 22, 23, 30, 25, 26, 30, 28, 29, 30, 31, 34, 33, 34, 35, 36, 37, 38, 39, 50, 41, 42, 43, 44, 45, 46, 47, 54, 49, 50, 51, 52, 53, 60, 55, 70, 57, 58, 59, 60, 61, 62, 63, 70, 65, 66, 67, 68

Offset: 1

Amiram Eldar, May 05 2023

The number of these divisors is A362852(n).

The indices of records of a(n)/n are the primorials (A002110) cubed, i.e., 1 and the terms of A115964.

			a(8) = 10 since 8 has 2 divisors that are both bi-unitary and exponential, 2 and 8, and 2 + 8 = 10.

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

Cf. A002110, A004709, A051377, A082020, A115964, A188999, A222266, A322791, A361810, A362852.

f[p_, e_] := DivisorSum[e, p^# &] - If[OddQ[e], 0, p^(e/2)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

s(p, e) = sumdiv(e, d, p^d*(2*d != e));
a(n) = {my(f = factor(n)); prod(i = 1, #f~, s(f[i, 1], f[i, 2]));}

Multiplicative with a(p^e) = Sum_{d|e} p^d if e is odd, and (Sum_{d|e} p^d) - p^(e/2) if e is even.
a(n) >= n, with equality if and only if n is cubefree (A004709).
limsup_{n->oo} a(n)/n = Product_{p prime} (1 + 1/p^2) = 15/Pi^2 (A082020).
Sum_{k=1..n} a(k) ~ c * n^2, where c = (1/2) * Product_{p prime} ((1 - 1/p)*(1 + Sum_{e>=1} Sum_{d|e, d != e/2}, p^(d-2*e))) = 0.5124353304539905... .

A362984 Decimal expansion of the asymptotic mean of the abundancy index of the powerful numbers (A001694).

Original entry on oeis.org

2, 1, 4, 9, 6, 8, 6, 9, 0, 3, 0, 1, 5, 2, 6, 7, 6, 5, 1, 2, 8, 2, 1, 9, 0, 4, 2, 1, 0, 5, 1, 0, 9, 4, 1, 6, 1, 4, 5, 9, 8, 7, 6, 5, 3, 2, 7, 5, 1, 0, 0, 9, 9, 9, 8, 7, 3, 2, 7, 3, 3, 4, 3, 7, 8, 9, 7, 6, 2, 7, 1, 7, 9, 4, 0, 3, 6, 4, 2, 3, 6, 5, 7, 4, 2, 7, 4, 2, 3, 7, 7, 1, 7, 0, 2, 4, 2, 2, 8, 9, 7, 3, 8, 6, 2

Offset: 1

Amiram Eldar, May 12 2023

The abundancy index of a positive integer k is A000203(k)/k = A017665(k)/A017666(k).

The asymptotic mean of the abundancy index over all the positive integers is lim_{m->oo} (1/m) * Sum_{k=1..m} A000203(k)/k = Pi^2/6 = zeta(2) = 1.644934... (A013661).

			2.14968690301526765128219042105109416145987653275100999873...

Rafael Jakimczuk and Matilde Lalín, Asymptotics of sums of divisor functions over sequences with restricted factorization structure, Notes on Number Theory and Discrete Mathematics, Vol. 28, No. 4 (2022), pp. 617-634, eq. (6).

Cf. A000203, A001694, A017665, A017666, A180114.

Similar constants (the asymptotic mean of the abundancy index of other sequences): A013661 (all positive integers), A082020 (cubefree), A111003 (odd), A157292 (5-free), A157294 (7-free), A157296 (9-free), A240976 (squares), A245058 (even), A306633 (squarefree), A362985 (cubefull).

$MaxExtraPrecision = 1000; m = 1000; c = LinearRecurrence[{2, -3, 4, -6, 7, -7, 7, -6, 5, -3, 2, -1}, {0, 0, 0, 4, 5, 6, 0, -12, -9, -5, 0, 22}, m]; RealDigits[(2^4 + 2^2 + 2^(3/2) - 1)/(2^4 - 2)*(3^4 + 3^2 + 3^(3/2) - 1)/(3^4 - 3) * Exp[NSum[Indexed[c, n]*(PrimeZetaP[n/2] - 1/2^(n/2) - 1/3^(n/2))/n, {n, 4, m}, NSumTerms -> m, WorkingPrecision -> m]], 10, 120][[1]]

prodeulerrat((p^8 + p^4 + p^3 - 1)/(p^8 - p^2), 1/2)

Equals lim_{m->oo} (1/m) * Sum_{k=1..m} A180114(k)/A001694(k).

Equals Product_{p prime} (p^4 + p^2 + p^(3/2) - 1)/(p^4 - p) = Product_{p prime} (1 + (p^2 + p^(3/2) + p - 1)/(p^4 - p)) (Jakimczuk and Lalín, 2022).

A362985 Decimal expansion of the asymptotic mean of the abundancy index of the cubefull numbers (A036966).

Original entry on oeis.org

2, 4, 8, 2, 1, 7, 9, 1, 9, 6, 4, 2, 2, 3, 5, 9, 5, 2, 5, 4, 6, 1, 6, 7, 6, 4, 3, 6, 7, 4, 6, 8, 7, 6, 9, 8, 5, 3, 6, 3, 6, 8, 9, 4, 0, 9, 7, 1, 9, 3, 0, 4, 6, 8, 3, 5, 4, 3, 6, 3, 9, 3, 2, 8, 1, 4, 4, 4, 2, 3, 3, 8, 8, 5, 7, 6, 7, 5, 0, 4, 6, 3, 4, 1, 1, 5, 0, 7, 3, 1, 0, 3, 9, 8, 0, 4, 4, 7, 4, 0, 3, 7, 3, 1, 0

Offset: 1

Amiram Eldar, May 12 2023

			2.48217919642235952546167643674687698536368940971930468354...

Rafael Jakimczuk and Matilde Lalín, Asymptotics of sums of divisor functions over sequences with restricted factorization structure, Notes on Number Theory and Discrete Mathematics, Vol. 28, No. 4 (2022), pp. 617-634, eq. (6).

Cf. A000203, A036966, A017665, A017666, A362986.

Similar constants (the asymptotic mean of the abundancy index of other sequences): A013661 (all positive integers), A082020 (cubefree), A111003 (odd), A157292 (5-free), A157294 (7-free), A157296 (9-free), A245058 (even), A240976 (squares), A306633 (squarefree), A362984 (powerful).

$MaxExtraPrecision = 1000; m = 1000; c = LinearRecurrence[{2, -1, -2, 3, -2, -1, 3, -2, -2, 3, -1, -2, 3, -1, -1, 1}, {0, 0, 0, -4, 0, 6, 7, 4, 9, 0, -11, -22, -26, -21, -15, 20}, m]; RealDigits[((2^5 + 2^(10/3) + 2^3 + 2^(8/3) - 1)/(2^(10/3)*(2^(5/3) + 2^(1/3) + 1)))*((3^5 + 3^(10/3) + 3^3 + 3^(8/3) - 1)/(3^(10/3)*(3^(5/3) + 3^(1/3) + 1))) * Zeta[4/3] * Exp[NSum[Indexed[c, n]*(PrimeZetaP[n/3] - 1/2^(n/3) - 1/3^(n/3))/n, {n, 4, m}, NSumTerms -> m, WorkingPrecision -> m]], 10, 120][[1]]

zeta(4/3) * prodeulerrat((p^15 + p^10 + p^9 + p^8 - 1)/(p^10 * (p^5 + p + 1)), 1/3)

Equals lim_{m->oo} (1/m) * Sum_{k=1..m} A362986(k)/A036966(k).

Equals zeta(4/3) * Product_{p prime} ((p^5 + p^(10/3) + p^3 + p^(8/3) - 1)/(p^(10/3) * (p^(5/3) + p^(1/3) + 1))).

A377846 Powerful numbers that are not divisible by the cubes of more than one distinct prime.

Original entry on oeis.org

1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 72, 81, 100, 108, 121, 125, 128, 144, 169, 196, 200, 225, 243, 256, 288, 289, 324, 343, 361, 392, 400, 441, 484, 500, 512, 529, 576, 625, 675, 676, 729, 784, 800, 841, 900, 961, 968, 972, 1024, 1089, 1125, 1152, 1156, 1225

Offset: 1

Amiram Eldar, Nov 09 2024

Subsequence of A377821 and first differs from it at n = 33: A377821(33) = 432 = 2^4 * 3^3 is not a term of this sequence.

Numbers whose prime factorization has exponents that are all larger than 1 and no more than one exponent is larger than 2.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Index entries for sequences related to powerful numbers.

Complement of A376936 within A001694.
Subsequence of A377821.
Subsequences: A143610, A377847.
Cf. A082020.

q[n_] := Module[{e = Sort[FactorInteger[n][[;; , 2]]]}, Length[e] == 1 || e[[-2]] == 2]; With[{max = 1300}, Select[Union@ Flatten@ Table[i^2 * j^3, {j, 1, max^(1/3)}, {i, 1, Sqrt[max/j^3]}], # == 1 || q[#] &]]

is(k) = if(k == 1, 1, my(e = vecsort(factor(k)[, 2])); e[1] > 1 && (#e == 1 || e[#e - 1] == 2));

Sum_{n>=1} 1/a(n) = (15/Pi^2) * (1 + Sum_{p prime} 1/((p-1)*(p^2+1))) = 1.92240214785252516795... .

A377847 Powerful numbers that are divisible by the cube of a single prime.

Original entry on oeis.org

8, 16, 27, 32, 64, 72, 81, 108, 125, 128, 144, 200, 243, 256, 288, 324, 343, 392, 400, 500, 512, 576, 625, 675, 729, 784, 800, 968, 972, 1024, 1125, 1152, 1323, 1331, 1352, 1372, 1568, 1600, 1800, 1936, 2025, 2048, 2187, 2197, 2304, 2312, 2401, 2500, 2700, 2704, 2888, 2916

Offset: 1

Amiram Eldar, Nov 09 2024

Numbers whose prime factorization contains one exponent that equals 3, and all the others, if they exist, are equal to 2.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Index entries for sequences related to powerful numbers.

Subsequence of A001694, A320966 and A377846.
A030078 is a subsequence.
Cf. A082020.

q[n_] := Module[{e = Sort[FactorInteger[n][[;; , 2]]]}, e[[-1]] > 2 && (Length[e] == 1 || e[[-2]] == 2)]; With[{max = 3000}, Select[Union@ Flatten@Table[i^2 * j^3, {j, 1, max^(1/3)}, {i, 1, Sqrt[max/j^3]}], q]]

is(k) = if(k == 1, 0, my(e = vecsort(factor(k)[, 2])); e[1] > 1 && e[#e] > 2 && (#e == 1 || e[#e - 1] == 2));

Sum_{n>=1} 1/a(n) = (15/Pi^2) * Sum_{p prime} 1/((p-1)*(p^2+1)) = 0.40258439321745859629... .

cp's OEIS Frontend

A378900 Squares of numbers divisible by the squares of two distinct primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A378984 Squares in A378769.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A157294 Decimal expansion of 1575/Pi^6.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A157296 Decimal expansion of 31185/(2*Pi^8).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A269404 Decimal expansion of Product_{k >= 1} (1 + 1/prime(k)^6).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A362854 The sum of the divisors of n that are both bi-unitary and exponential.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A362984 Decimal expansion of the asymptotic mean of the abundancy index of the powerful numbers (A001694).

Views

Author

Keywords

Comments

Examples

Links