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.

A368714 Numbers whose maximal exponent in their prime factorization is even.

Original entry on oeis.org

1, 4, 9, 12, 16, 18, 20, 25, 28, 36, 44, 45, 48, 49, 50, 52, 60, 63, 64, 68, 75, 76, 80, 81, 84, 90, 92, 98, 99, 100, 112, 116, 117, 121, 124, 126, 132, 140, 144, 147, 148, 150, 153, 156, 162, 164, 169, 171, 172, 175, 176, 180, 188, 192, 196, 198, 204, 207, 208
Offset: 1

Views

Author

Amiram Eldar, Jan 04 2024

Keywords

Comments

First differs from A240112 at n = 30.
Numbers k such that A051903(k) is even.
The asymptotic density of this sequence is Sum_{k>=2} (-1)^k * (1 - 1/zeta(k)) = 0.27591672059822700769... .

Crossrefs

Programs

  • Mathematica
    Select[Range[210], # == 1 || EvenQ[Max[FactorInteger[#][[;;, 2]]]] &]
  • PARI
    lista(kmax) = for(k = 1, kmax, if(k == 1 || !(vecmax(factor(k)[,2])%2), print1(k, ", ")));

A240111 Numbers for which the value of the Dedekind psi function (A001615) are less than the value of the infinitary Dedekind psi function (A049417).

Original entry on oeis.org

8, 24, 27, 32, 40, 54, 56, 72, 88, 96, 104, 120, 125, 128, 135, 136, 152, 160, 168, 184, 189, 200, 216, 224, 232, 243, 248, 250, 264, 270, 280, 296, 297, 312, 328, 343, 344, 351, 352, 360, 375, 376, 378, 384, 392, 408, 416, 424, 440, 456, 459, 472, 480, 486
Offset: 1

Views

Author

Vladimir Shevelev, Apr 01 2014

Keywords

Comments

Numbers k for which Product_{p|k} (1 + 1/p) < Product_{q is in Q_k} (1 + 1/q), where {p} are primes, {q} are terms of A050376 and Q_k is the set of distinct q's whose product is k.
The numbers of terms that do not exceed 10^k, for k = 1, 2, ..., are 1, 10, 108, 1072, 10679, 106722, 1067287, 10672851, 106728514, 1067285714, ... . Apparently, the asymptotic density of this sequence exists and equals 0.1067285... . - Amiram Eldar, Feb 13 2025

Crossrefs

Complement of A240112 within the nonsquarefree numbers (A013929).

Programs

  • Mathematica
    f1[p_, e_] := Module[{b = IntegerDigits[e, 2]}, m = Length[b]; Product[If[b[[j]] > 0, 1 + p^(2^(m - j)), 1], {j, 1, m}]]; f2[p_, e_] := (p+1)*p^(e-1); q[1] = False; q[n_] := Module[{fct = FactorInteger[n]}, Times @@ f2 @@@ fct < Times @@ f1 @@@ fct]; Select[Range[500], q] (* Amiram Eldar, Feb 13 2025 *)
  • PARI
    isok(k) = {my(f = factor(k), b); prod(i=1, #f~, (f[i, 1]+1)*f[i, 1]^(f[i, 2]-1)) < prod(i=1, #f~, b = binary(f[i, 2]); prod(k=1, #b, if(b[k], 1+f[i, 1]^(2^(#b-k)), 1)));} \\ Amiram Eldar, Feb 13 2025

Extensions

More terms from Peter J. C. Moses, Apr 02 2014

A384519 Numbers whose powerful part (A057521) is greater than 1 and is equal to a squarefree number raised to an even power (A384517).

Original entry on oeis.org

4, 9, 12, 16, 18, 20, 25, 28, 36, 44, 45, 48, 49, 50, 52, 60, 63, 64, 68, 75, 76, 80, 81, 84, 90, 92, 98, 99, 100, 112, 116, 117, 121, 124, 126, 132, 140, 147, 148, 150, 153, 156, 162, 164, 169, 171, 172, 175, 176, 180, 188, 192, 196, 198, 204, 207, 208, 212, 220
Offset: 1

Views

Author

Amiram Eldar, Jun 01 2025

Keywords

Comments

Subsequence of A240112 and first differs from it at n = 30: A240112(30) = 108 is not a term of this sequence.
Subsequence of A368714 and differs from it by not having the terms 1, 144, 324, 400, 432, ... .
Numbers whose prime factorization has one distinct exponent that is larger than 1 and it is even.
Numbers that are a product of a squarefree number (A005117) and a coprime nonsquarefree number that is a squarefree number raised to an even power (A384517).
The asymptotic density of this sequence is Sum_{k>=1} (d(2*k)-1)/zeta(2) = 0.265530259454558018819..., where d(k) = zeta(k) * Product_{p prime} (1 + Sum_{i=k+1..2*k-1} (-1)^i/p^i).

Crossrefs

Intersection of A335275 and A375142.
Intersection of A368714 and A375142.
Equals A375142 \ A384520.
Subsequence of A013929 and A240112.
Subsequences: A067259, A384517.

Programs

  • Mathematica
    q[n_] := Module[{u = Union[Select[FactorInteger[n][[;; , 2]], # > 1 &]]}, Length[u] == 1 && EvenQ[u[[1]]]]; Select[Range[250], q]
  • PARI
    isok(k) = {my(e = select(x -> (x > 1), Set(factor(k)[, 2]))); #e == 1 && !(e[1] % 2);}
Showing 1-3 of 3 results.