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-4 of 4 results.

A380692 Numbers k such that the least prime dividing k is larger than the maximum exponent in the prime factorization of k; a(1) = 1 by convention.

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 25, 26, 29, 30, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 45, 46, 47, 49, 51, 53, 55, 57, 58, 59, 61, 62, 63, 65, 66, 67, 69, 70, 71, 73, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 99
Offset: 1

Views

Author

Amiram Eldar, Jan 30 2025

Keywords

Comments

First differs from A368110 at n = 68: A368110(68) = 98 is not a term of this sequence.
First differs from its subsequence A380695 at n = 428: a(428) = 625 is not a term of A380695.
Numbers k such that A020639(k) > A051903(k).
All the squarefree numbers (A005117) are terms, and all the odd terms of A067259 are terms of this sequence.
Disjoint union of the sequences S_k, k >= 1, where S_k is the sequence of p-rough numbers (numbers whose prime factors are all greater than or equal to p), with p = nextprime(k) = A151800(k), whose maximum exponent in their prime factorization is k (i.e., numbers that are (k+1)-free but not k-free, where k-free numbers are numbers whose prime factorization exponents do not exceed k).
The asymptotic density of this sequence is Sum_{i>=1} d(i) = 0.68213349032332767778..., where d(i), the density of S_i, equals f(i+1) * Product_{primes p <= i} ((1-1/p)/(1-1/p^(i+1))) - f(i) * Product_{primes p <= i} ((1-1/p)/(1-1/p^i)), f(i) = 1/zeta(i) if i >= 2, and f(1) = 0.

Examples

			6 = 2^1 * 3^1 is a term since 2 > 1.
8 = 2^3 is not a term since 2 < 3.

Links

Crossrefs

Cf. A020639, A051903, A151800, A368110.
Subsequence of A380693.
Subsequences: A005117, A136327, the intersection of A005408 and A067259, A380694, A380695.

Programs

  • Mathematica
    q[k_] := k == 1 || Module[{f = FactorInteger[k]}, f[[1, 1]] > Max[f[[;; , 2]]]]; Select[Range[100], q]
  • PARI
    isok(k) = if(k == 1, 0, my(f = factor(k), e = f[, 2]); f[1, 1] > vecmax(e));

A380693 Numbers k such that the least prime dividing k is larger than or equal to the maximum exponent in the prime factorization of k; a(1) = 1 by convention.

Original entry on oeis.org

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

Views

Author

Amiram Eldar, Jan 30 2025

Keywords

Comments

First differs from A047592, A187320, A207481 and A255805 at n = 48: A047592(48) = A187320(48) = A207481(48) = A255805(48) = 54 is not a term of this sequence.
Numbers k such that A020639(k) >= A051903(k).
Disjoint union of the sequences S_k, k >= 1, where S_k is the sequence of p-rough numbers (numbers whose prime factors are all greater than or equal to p), with p = nextprime(k) = A007918(k), whose maximum exponent in their prime factorization is k (i.e., numbers that are (k+1)-free but not k-free, where k-free numbers are numbers whose prime factorization exponents do not exceed k).
The asymptotic density of this sequence is Sum_{i>=1} d(i) = 0.84999238500582943243..., where d(i), the density of S_i, equals f(i+1) * Product_{primes p < i} ((1-1/p)/(1-1/p^(i+1))) - f(i) * Product_{primes p < i} ((1-1/p)/(1-1/p^i)), f(i) = 1/zeta(i) if i >= 2, and f(1) = 0.

Examples

			6 = 2^1 * 3^1 is a term since 2 >= 1.
8 = 2^3 is not a term since 2 < 3.

Links

Crossrefs

Cf. A020639, A051903, A007918.
Cf. A047592, A187320, A207481, A255805.
Subsequences: A380692, A380694, A380695.

Programs

  • Mathematica
    q[k_] := k == 1 || Module[{f = FactorInteger[k]}, f[[1, 1]] >= Max[f[[;; , 2]]]]; Select[Range[100], q]
  • PARI
    isok(k) = if(k == 1, 0, my(f = factor(k), e = f[, 2]); f[1, 1] >= vecmax(e));

A380694 Numbers k such that the prime index of the least prime dividing k is larger than the maximum exponent in the prime factorization of k.

Original entry on oeis.org

3, 5, 7, 11, 13, 15, 17, 19, 21, 23, 25, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 65, 67, 69, 71, 73, 77, 79, 83, 85, 87, 89, 91, 93, 95, 97, 101, 103, 105, 107, 109, 111, 113, 115, 119, 121, 123, 127, 129, 131, 133, 137, 139, 141, 143, 145, 149
Offset: 1

Views

Author

Amiram Eldar, Jan 30 2025

Keywords

Comments

Differs from A352830 by having the terms 1225, 13475, 15925, ... and not having the terms 1, 147, 363, 507, 867, 1083, ... .
Differs from A320055 by having the terms 105, 165, 195, ... and not having the terms 1 and 2.
Differs from A320056 by having the terms 105, 165, 195, ... and not having the term 1.
Numbers k such that A055396(k) > A051903(k).
Disjoint union of the sequences S_k, k >= 1, where S_k is the sequence of p-rough numbers (numbers whose prime factors are all greater than or equal to p), with p = prime(k+1), whose maximum exponent in their prime factorization is k (i.e., numbers that are (k+1)-free but not k-free, where k-free numbers are numbers whose prime factorization exponents do not exceed k).
The asymptotic density of this sequence is Sum_{i>=1} d(i) = 0.43156823896267860476......, where d(i), the density of S_i, equals f(i+1) * Product_{primes p <= prime(i)} ((1-1/p)/(1-1/p^(i+1))) - f(i) * Product_{primes p <= prime(i)} ((1-1/p)/(1-1/p^i)), f(i) = 1/zeta(i) if i >= 2, and f(1) = 0.

Examples

			3 = 3^1 is a term since PrimePi(3) = 2 > 1.
9 = 3^2 is not a term since PrimePi(3) = 2 is not larger than the exponent 2.
25 = 5^2 is a term since PrimePi(5) = 3 > 2.

Links

Crossrefs

Cf. A000720, A020639, A051903, A055396.
Cf. A352830, A320055, A320056.
Subsequence of A380692, A380693 and A380695.

Programs

  • Mathematica
    q[k_] := k > 1 && Module[{f = FactorInteger[k]}, f[[1, 1]] > Prime[Max[f[[;; , 2]]]]]; Select[Range[150], q]
  • PARI
    isok(k) = if(k == 1, 0, my(f = factor(k), e = f[,2]); f[1,1] > prime(vecmax(e)));

A380733 Numbers k such that the prime index of the largest prime dividing k is smaller than or equal to the minimum exponent in the prime factorization of k; a(1) = 1 by convention.

Original entry on oeis.org

1, 2, 4, 8, 9, 16, 27, 32, 36, 64, 72, 81, 108, 125, 128, 144, 216, 243, 256, 288, 324, 432, 512, 576, 625, 648, 729, 864, 972, 1000, 1024, 1152, 1296, 1728, 1944, 2000, 2048, 2187, 2304, 2401, 2592, 2916, 3125, 3375, 3456, 3888, 4000, 4096, 4608, 5000, 5184, 5832
Offset: 1

Views

Author

Amiram Eldar, Jan 31 2025

Keywords

Comments

Numbers k such that A061395(k) <= A051904(k).
Except for 2, all the terms are powerful (A001694).
Disjoint union of the sequences S_k, k >= 1, where S_k is the sequence of p-smooth numbers (numbers whose prime factors are all less than or equal to p), with p = prime(k), that are k-full but not (k+1)-full numbers (k-full numbers are numbers whose prime factorization exponents are all larger than or equal to k). S_1 contains only the term 2, and S_k is infinite for k >= 2. The sum of the reciprocals of the terms of S_k is rational for all k: 1/2, 31/72, 2657/14400, ... (see the Formula section).

Examples

			4 = 2^2 is a term since PrimePi(2) = 1 <= 2.
25 = 5^2 is not a term since PrimePi(5) = 3 is larger than the exponent 2.

Links

Crossrefs

Cf. A001694, A006530, A051904, A061395, A380695.
Subsequences: A380730, A380731, A380732.

Programs

  • Mathematica
    Select[Range[6000], Module[{f = FactorInteger[#]}, f[[-1, 1]] <= Prime[Min[f[[;;, 2]]]]] &]
  • PARI
    isok(k) = if(k == 1, 1, my(f = factor(k), e = f[,2]); f[#f~, 1] <= prime(vecmin(e)));

Formula

Sum_{n>=1} 1/a(n) = Sum_{k>=1} f(k) = 1.263759868201220952806..., where f(k) = Sum_{i>=1} 1 / S_k(i) = g(k, k) - g(k+1, k), g(e, k) = Product_{j=1..k} (1 + Sum_{i >= e} 1/prime(j)^i), and S_k is defined in the Comments section.
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.