cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A375074 Numbers whose prime factorization exponents include at least one 2, at least one 3 and no higher exponents.

Original entry on oeis.org

72, 108, 200, 360, 392, 500, 504, 540, 600, 675, 756, 792, 936, 968, 1125, 1176, 1188, 1224, 1323, 1350, 1352, 1368, 1372, 1400, 1404, 1500, 1656, 1800, 1836, 1960, 2052, 2088, 2200, 2232, 2250, 2312, 2484, 2520, 2600, 2646, 2664, 2700, 2888, 2904, 2952, 3087
Offset: 1

Views

Author

Amiram Eldar, Jul 29 2024

Keywords

Comments

Numbers whose powerful part (A057521) is a term of A375073.
The asymptotic density of this sequence is 1/zeta(4) - 1/zeta(3) + 1/zeta(2) - zeta(6)/(zeta(2) * zeta(3)) * c = A215267 - A088453 + A059956 - A068468 * c = 0.0156712080080470088619..., where c = Product_{p prime} (1 + 2/p^3 - 1/p^4 + 1/p^5).

Crossrefs

Equals A046100 \ (A004709 UNION A336591).
Disjoint union of A375073 and A375075.

Programs

  • Mathematica
    Select[Range[3000], Union[Select[FactorInteger[#][[;; , 2]], # > 1 &]] == {2, 3} &]
  • PARI
    is(k) = Set(select(x -> x > 1, factor(k)[,2])) == [2, 3];

Formula

A051903(a(n)) = 3.

A375075 Numbers whose prime factorization exponents include at least one 1, at least one 2, at least one 3 and no other exponents.

Original entry on oeis.org

360, 504, 540, 600, 756, 792, 936, 1176, 1188, 1224, 1350, 1368, 1400, 1404, 1500, 1656, 1836, 1960, 2052, 2088, 2200, 2232, 2250, 2484, 2520, 2600, 2646, 2664, 2904, 2952, 3096, 3132, 3348, 3384, 3400, 3500, 3780, 3800, 3816, 3960, 3996, 4056, 4116, 4200, 4248, 4312, 4392, 4428
Offset: 1

Views

Author

Amiram Eldar, Jul 29 2024

Keywords

Comments

First differs from its subsequence A163569 at n = 25: a(25) = 2520 = 2^3 * 3^2 * 5 * 7 is not a term of A163569.
Numbers k such that the set of distinct prime factorization exponents of k (row k of A136568) is {1, 2, 3}.
The asymptotic densities of this sequence and A375074 are equal (0.0156712..., see A375074 for a formula), since the terms in A375074 that are not in this sequence (A375073) have a density 0.

Crossrefs

Intersection of A375072 and A317090.
Equals A375074 \ A375073.
Subsequence of A046100 and A176297.
A163569 is a subsequence.

Programs

  • Mathematica
    Select[Range[4500], Union[FactorInteger[#][[;; , 2]]] == {1, 2, 3} &]
  • PARI
    is(k) = Set(factor(k)[,2]) == [1, 2, 3];

A375143 Numbers whose prime factorization has a minimum exponent that is larger than 1 and is 1 less than the maximum exponent.

Original entry on oeis.org

72, 108, 200, 392, 432, 500, 648, 675, 968, 1125, 1323, 1352, 1372, 1800, 2000, 2312, 2592, 2700, 2888, 3087, 3267, 3528, 3888, 4232, 4500, 4563, 5000, 5292, 5324, 5400, 5488, 6125, 6728, 7688, 7803, 8575, 8712, 8788, 9000, 9747, 9800, 10125, 10584, 10952, 11979
Offset: 1

Views

Author

Amiram Eldar, Aug 01 2024

Keywords

Comments

Numbers k such that 2 <= A051904(k) = A051903(k) - 1.
Numbers that are product of two coprime nonsquarefree powers of squarefree numbers (A072777) with consecutive exponents.

Examples

			72 = 2^3 * 3^2 is a term since A051904(72) = 2 is larger than 1 and is 1 less than A051903(72) = 3.
		

Crossrefs

Subsequence of A001694.
Subsequences: A143610, A167747 \ {1, 2, 12}, A093136 \ {1, 2, 20}, A179666, A179702, A190472, A375073.

Programs

  • Mathematica
    q[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, 2 <= Min[e] == Max[e] - 1]; Select[Range[12000], q]
  • PARI
    is(k) = {my(e = factor(k)[,2]); k > 1 && 2 <= vecmin(e) && vecmin(e) + 1 == vecmax(e);}

Formula

Sum_{n>=1} 1/a(n) = Sum_{k>=2} f(k) = 0.053695635500385312854..., where f(k) = Product_{p prime} (1 + 1/p^k + 1/p^(k+1)) - zeta(k)/zeta(2*k) - zeta(k+1)/zeta(2*k+2) + 1 is the sum of reciprocals of the subset of numbers m with A051904(m) = k.
Showing 1-3 of 3 results.