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.

User: Hal M. Switkay

Hal M. Switkay's wiki page.

Hal M. Switkay has authored 35 sequences. Here are the ten most recent ones:

A385974 a(n) = the number of reduced positive proper fractions p/q with phi(q) <= n.

Original entry on oeis.org

1, 7, 7, 23, 23, 47, 47, 87, 87, 107, 107, 179, 179, 179, 179, 275, 275, 347, 347, 447, 447, 491, 491, 731, 731, 731, 731, 787, 787, 847, 847, 1071, 1071, 1071, 1071, 1359, 1359, 1359, 1359, 1719, 1719, 1887, 1887, 2019, 2019, 2111, 2111, 2639, 2639, 2639, 2639, 2743, 2743, 2851, 2851
Offset: 1

Author

Hal M. Switkay, Jul 13 2025

Keywords

Comments

This sequence groups the reduced positive proper fractions p/q in a manner analogous to the Farey sequence (A005728, which adds the endpoints 0/1 and 1/1). However, instead of limiting the size of the denominator (q <= n as is done in the Farey sequence), we limit phi(q) = A000010(q), where phi is the Euler totient function. The computation requires A014197(r) = the number of natural numbers q such that phi(q) = r.
When k > 0, a(2k+1) = a(2k), because there are no natural numbers whose Euler totient equals 2k+1.

Examples

			a(4) enumerates the positive proper fractions whose denominator has Euler totient <= 4. The eligible denominators are 2; 3, 4, 6; 5, 8, 10, 12. The numerators are relatively prime to the denominators. Grouping the fractions by the order of the denominators above, we get: 1/2; 1/3, 2/3, 1/4, 3/4, 1/6, 5/6; 1/5, 2/5, 3/5, 4/5, 1/8, 3/8, 5/8, 7/8, 1/10, 3/10, 7/10, 9/10, 1/12, 5/12, 7/12, 11/12. Thus a(4) = 23.
		

Crossrefs

Programs

Formula

a(n) = -1 + Sum_{i=1..n} i*A014197(i).

A385722 a(n) = the n-th term of the sequence B_2 defined as the ordered union of the ranges of A_x, where the sequence A_x is defined in A384669, and x is a proper positive fraction with denominator 2, 3, 4, or 6.

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 16, 24, 30, 32, 36, 48, 60, 64, 72, 96, 120, 128, 144, 180, 192, 210, 240, 256, 288, 360, 384, 420, 480, 512, 576, 720, 768, 840, 960, 1024, 1152, 1260, 1440, 1536, 1680, 1920, 2048, 2304, 2310, 2520, 2880, 3072, 3360, 3840, 4096, 4320, 4608, 4620, 5040
Offset: 1

Author

Hal M. Switkay, Jul 07 2025

Keywords

Comments

The sequences A_x were defined in A384669; please see that sequence for more details.
Because of the continuity of the functions g_k(x) defined in A384669, if k is a term of A_y, then k is a term of A_x with x rational sufficiently close to y; so it suffices to study A_x for x rational, 0 < x < 1.
Let x = p/q, with p and q natural numbers, p < q. Then B_n is the ordered union of the ranges of A_x, where q has Euler totient <= n (that is, A000010(q) <= n). B_1 is just the sequence A_(1/2), that is, A384669. The present sequence B_2 is the ordered union of the ranges of A_x, where x = 1/6, 1/4, 1/3, 1/2, 2/3, 3/4, 5/6.
8 is the first term in B_2 (this sequence) that is not in B_1 = A384669.
15120 appears to be the first term in B_4 that is not in B_2 (this sequence).
More discussion about B_n and B_oo appears in a linked pdf.

Examples

			8 is a term of A_(2/3) and therefore of this sequence as well as A_x for x > 2/3, even though 8 is not a term of A384669, because 3^(2/3) (corresponding to 8) > 2 = 1^(2/3) + 1^(2/3) (corresponding to 6). Thus 8 qualifies to be a term in B_2, this sequence.
		

Programs

  • PARI
    s(n, q) = my(f=factor(n)); sum(k=1, #f~, f[k, 2]^q);
    listaq(nn, q) = my(r=-oo, list=List()); for (n=1, nn, my(ss=s(n, q)); if (ss > r, r = ss; listput(list, n)); ); Vec(list);
    putlist(list, elems) = for (i=1, #elems, listput(list, elems[i])); list;
    lista(nn) = my(list=List(), vq=[1/6, 1/4, 1/3, 1/2, 2/3, 3/4, 5/6]); for (i=1, #vq, list = putlist(list, listaq(nn, vq[i]))); Set(Vec(list)); \\ Michel Marcus, Jul 08 2025

A384669 Positive integers setting a new record for the sum of the square roots of the prime exponents.

Original entry on oeis.org

1, 2, 4, 6, 12, 24, 30, 60, 120, 180, 210, 360, 420, 840, 1260, 1680, 2520, 3360, 4620, 6720, 7560, 9240, 13860, 18480, 27720, 36960, 55440, 73920, 83160, 110880, 120120, 180180, 221760, 240240, 360360, 480480, 720720, 960960, 1081080, 1441440, 2042040, 2882880, 4084080, 5765760, 6126120
Offset: 1

Author

Hal M. Switkay, Jun 06 2025

Keywords

Comments

This sequence is the special case x = 1/2 of a class of sequences A_x indexed by real numbers x, defined as follows. Let k be a natural number with prime factorization k = Product_{i=1..r} (p_i)^(e_i), where p_i are distinct primes, and e_i are natural numbers. Define f_x(k) = Sum_{i=1..r} (e_i)^x. Then the sequence A_x consists of natural numbers k where f_x(k) sets a new record.
We may define g_k(x) = f_x(k), so that g_k consists of real functions indexed by natural numbers. Each g_k is a sum of exponential functions, whose bases are natural numbers.
We provide facts, conjectures, and questions about the class of sequences A_x.
Facts:
For all real x, A_x is an infinite, increasing sequence of numbers of least prime signature (A025487) starting with 1 and 2.
For all x <= 0, A_x coincides with the primorials (A002110). For all x >= 1, A_x coincides with the powers of 2 (A000079). Thus the interesting sequences A_x have 0 <= x <= 1.
For all x > 0, A_x(n+1) <= 2*A_x(n).
1, 2, 4, 6, 12, 24, and no other natural numbers, are terms of every A_x with 0 < x < 1.
Conjectures:
The sequences A_x appear to be distinct in the following sense. Given 0 <= x < y <= 1, not only are A_x and A_y distinct, their ranges appear to have finite intersection.
Define A_0+, respectively A_1- as the limit of A_x as x approaches 0 from the right, respectively as x approaches 1 from the left. Then A_0+ appears to coincide with A168264, and A_1- appears to coincide with A029744 without the term 3.
If 0 < x < 1 and d is a natural number, then d divides some term of A_x.
If 0 < x < 1 and d is a natural number, then d divides infinitely many terms of A_x.
If 0 < x < 1 and d is a natural number, then d divides all sufficiently large terms of A_x.
Define S_n to be the set of x for which A_x(n) achieves a minimum value as a function of x (well-defined because the values are integers). Then for fixed n >= 10, S_n appears to be a subset of the interval log(2)/log(3) <= x <= log(3)/log(4), although in general S_n itself is not an interval.
Questions:
Does every number of least prime signature appear in at least one A_x for some x? 216 is not a term in any A_x I have examined.
Are there any x for which A_x contains infinitely many highly composite numbers (A002182), respectively infinitely many deeply composite numbers (A095848)?
Does the sequence of sets S_n have any limit points x in [0,1]? If x is such a limit point, A_x would presumably grow more slowly than other A_x. Examining A_x for x rational with denominator 720, A_x appears to contain a maximum number of terms (80) less than 2 * 10! when x = 507/720, 511/720, 515/720, and 517/720, all between 0.70 and 0.72.
Answer to the first question above: No, 216 is not a term of A_x for any x. If it were, we would have g_216(x) > g_210(x) and g_216(x) > g_192(x), i.e., 2*3^x > 4 and 2*3^x > 6^x+1. The first inequality holds only if x > x0 = log(2)/log(3). But 2*3^x0 < 6^x0+1 and it is easily verified that the function 2*3^x - (6^x+1) is decreasing for x > x0, so the second equality cannot hold when x > x0. - Pontus von Brömssen, Jun 13 2025
Additional facts from Hal M. Switkay, Jun 29 2025: (Start)
If k1 and k2 have the same prime signature, then the functions g_k1(x) and g_k2(x) are identical. Hence g_k(x) is identical to g_A046523(k)(x), where A046523(k) is the smallest number with the same prime signature as k. This is why the terms of A_x are all numbers of least prime signature.
For all k, lim_{x->-oo} g_k(x) = A056169(k) = the number of unitary prime divisors of k.
For all k, g_k(0) = omega(k) = A001221(k) = the number of distinct prime divisors of k.
For all k, g_k(1) = bigomega(k) = A001222(k) = the number of prime divisors of k counted with multiplicity.
For all k > 1, lim_{x->oo} [log(g_k(x))/x] = log(A051903(k)), where A051903(k) = the maximum exponent in the prime factorization of k. When k has least prime signature, A051903(k) = A007814(k), the exponent of the largest power of 2 dividing k. (End)
Using the notation of A385722, this sequence is B_1. - Hal M. Switkay, Jul 27 2025

Examples

			f_(1/2)(24) = sqrt(3) + sqrt(1), because 24 = (2^3)(3^1). This is a record value for f_(1/2), so 24 is in the sequence. f_(1/2)(30) = sqrt(1) + sqrt(1) + sqrt(1) (because 30 = (2^1)(3^1)(5^1)), which is larger still, putting 30 in the sequence. However, f_(1/2)(32) = sqrt(5) (because 32 = 2^5), smaller than the previous value, so 32 is not in the sequence.
g_216(x) = 3^x + 3^x, because 216 = (2^3)(3^3).
		

Programs

  • Mathematica
    s[n_] := Total[Sqrt[FactorInteger[n][[;; , 2]]]]; s[1] = 0; With[{lps = Cases[Import[ "https://oeis.org/A025487/b025487.txt", "Table"], {, }][[;; , 2]]}, sm = -1; seq = {}; Do[s1 = s[lps[[i]]]; If[s1 > sm, sm = s1; AppendTo[seq, lps[[i]]]], {i, 1, Length[lps]}]; seq] (* Amiram Eldar, Jun 08 2025 *)
  • PARI
    s(n) = my(f=factor(n)); sum(k=1, #f~, sqrt(f[k,2]));
    lista(nn) = my(r=-oo, list=List()); for (n=1, nn, my(ss=s(n)); if (ss > r, r = ss; listput(list, n));); Vec(list); \\ Michel Marcus, Jun 15 2025

A384564 a(n) = the least natural number not already in the sequence whose prime signature is conjugate to that of n.

Original entry on oeis.org

1, 2, 3, 6, 5, 4, 7, 30, 10, 9, 11, 12, 13, 25, 49, 210, 17, 18, 19, 20, 121, 169, 23, 60, 14, 289, 42, 28, 29, 8, 31, 2310, 361, 529, 841, 36, 37, 961, 1369, 84, 41, 27, 43, 44, 45, 1681, 47, 420, 15, 50, 1849, 52, 53, 90, 2209, 126, 2809, 3481, 59, 24, 61, 3721, 63, 30030, 4489, 125, 67, 68, 5041, 343, 71, 180
Offset: 1

Author

Hal M. Switkay, Jun 03 2025

Keywords

Comments

This sequence is an involutory (period 2) permutation of the natural numbers. Its graph is symmetric in the line a(n) = n. It fixes all numbers with self-conjugate prime signatures (A384084), including 1 and the primes (A000040). It exchanges prime squares (A001248) and products of two distinct primes (A006881). It exchanges powers of 2 (A000079) with primorials (A002110).

Examples

			The implied partition corresponding to k is the partition of bigomega(k) (A001222) formed by the prime exponents. For example, bigomega(18) = 3, which is partitioned as 2 + 1, because 18 = (3^2)*(2^1). Because this is a self-conjugate partition, a(18) = 18. Similarly, bigomega(42) = 3, which is partitioned as 1 + 1 + 1, because 42 = (2^1)*(3^1)*(7^1). The conjugate partition is 3, so a(42) is the cube of a prime.
		

Programs

  • Mathematica
    sig[n_] := Sort[FactorInteger[n][[;; , 2]], Greater]; conjp[p_] := ResourceFunction["ConjugatePartition"][p]; a[1] = 1; a[n_] := a[n] = Module[{p = conjp[sig[n]], k = 2}, While[!FreeQ[Array[a, n-1], k] || sig[k] != p, k++]; k]; Array[a, 100] (* Amiram Eldar, Jun 04 2025 *)

A384084 Numbers whose prime signatures are self-conjugate.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 12, 13, 17, 18, 19, 20, 23, 28, 29, 31, 36, 37, 41, 43, 44, 45, 47, 50, 52, 53, 59, 61, 63, 67, 68, 71, 73, 75, 76, 79, 83, 89, 92, 97, 98, 99, 100, 101, 103, 107, 109, 113, 116, 117, 120, 124, 127, 131, 137, 139, 147, 148, 149, 151, 153
Offset: 1

Author

Hal M. Switkay, May 18 2025

Keywords

Comments

The implied partition corresponding to k is the partition of bigomega(k) (A001222) formed by the prime exponents. For example, bigomega(18) = 3, which is partitioned as 2 + 1, because 18 = (3^2)(2^1), and 2 + 1 is a self-conjugate partition of 3. In contrast, while bigomega(42) = 3, 3 is partitioned as 1 + 1 + 1, because 42 = (2^1)(3^1)(7^1), and 1 + 1 + 1 is not a self-conjugate partition of 3.
This sequence is very similar to, but ultimately different from, A212166. The first difference is a(342) = 1083, whereas A212166(342) = 1080.
This sequence is a subsequence of A212166.
It includes 1 (empty partition) and all primes (A000040: partition 1), as well as numbers of the form (p^2)q, where p and q are distinct primes (A054753: partition 2 + 1).
k is a term in this sequence if and only if A046523(k) is a term in A181825.

Examples

			120 is a term; its prime factorization (2^3)(3^2)(5^1) is self-conjugate.
24 is not a term; its prime factorization (2^3)(3^1) is not self-conjugate.
		

Crossrefs

Programs

  • Mathematica
    selfQ[p_] := ResourceFunction["ConjugatePartition"][p] == p; q[n_] := selfQ[Sort[FactorInteger[n][[;;, 2]], Greater]]; Select[Range[200], q] (* Amiram Eldar, May 26 2025 *)

A381849 Intersection of A025487 and A242298.

Original entry on oeis.org

1, 2, 4, 6, 12, 24, 36, 48, 60, 120, 180, 240, 360, 420, 840, 1680, 2520, 5040, 7560, 10080, 12600, 15120, 20160, 25200, 27720, 55440, 83160, 110880, 138600, 166320, 221760, 277200, 332640, 360360, 720720, 1441440, 2162160, 2882880, 3603600, 4324320, 5765760, 6486480, 7207200, 8648640
Offset: 1

Author

Hal M. Switkay, May 18 2025

Keywords

Comments

This sequence properly includes the deeply composite numbers (A095848). 36 and 180 are the first terms of this sequence that are not deeply composite.

Examples

			Once we get to 60, all succeeding terms in the sequence must be divisible by 1, 2, 3, 4, 5, and 6. However, not all multiples of 60 that are less than 420 (LCM(1,...,7)) have least prime signature, so 300 is excluded. All other multiples of 60 between 60 and 420 have least prime signature, so they are terms of this sequence.
		

Crossrefs

A380146 Numbers that set records in A113901.

Original entry on oeis.org

1, 2, 4, 6, 12, 24, 30, 48, 60, 120, 210, 240, 420, 480, 840, 1680, 3360, 6720, 13440, 26880, 36960, 53760, 73920, 107520, 147840, 215040, 295680, 591360, 960960, 1182720, 1921920, 2365440, 3843840, 4730880, 7687680, 9461760, 15375360, 30750720, 61501440, 123002880
Offset: 1

Author

Hal M. Switkay, Jan 13 2025

Keywords

Comments

All terms in this sequence are numbers of least prime signature (A025487). Therefore it is easier to search for new terms in the product of A061394 (omega of least prime signature) and A036041 (bigomega of least prime signature). Similar to but ultimately different from A378630. Terms appear to be products of primorials (A002110) with powers of 2 (A000079), and thus are never divisible by the square of an odd prime.

Examples

			omega(60) = 3 and bigomega(60) = 4; their product is 12. This product is larger than that for any smaller natural number, so 60 is a term of this sequence.
		

A368777 a(n) is the largest divisor of n that is a term of the sequence A003418, the least common multiple of the first k natural numbers.

Original entry on oeis.org

1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 12, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 12, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 12, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 12, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 60, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 12, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 12
Offset: 1

Author

Hal M. Switkay, Jan 11 2024

Keywords

Comments

The graph of this sequence gives it the appearance of a ruler-like function. If n is odd, a(n) = 1. If n is even and not a multiple of 6, a(n) = 2. If n is a multiple of 6 but not of 12, a(n) = 6, and so on.

Examples

			a(18) = 6 as 18 is divisible by lcm(1, 2, 3) = 6 but not by lcm(1, 2, 3, 4) = 12. so 6 is the largest divisor of 18 that is a term of A003418. - _David A. Corneth_, Jan 28 2024
		

Crossrefs

Programs

  • Mathematica
    seq[max_] := Module[{lcms = Table[LCM @@ Range[k], {k, max}]}, Table[Max[Select[Divisors[k], MemberQ[lcms, #] &]], {k, 1, max}]]; seq[100] (* Amiram Eldar, Jan 12 2024 *)
  • PARI
    a(n) = for(i = 2, n, if(n%i != 0, return(lcm([1..i-1])))); n \\ David A. Corneth, Jan 27 2024

Formula

a(n) = A003418(A055874(n))

A367501 The orders, without repetition, of the subquotients of finite groups with irreducible representations in GL_5(Z).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 16, 18, 20, 24, 32, 36, 40, 48, 60, 64, 72, 80, 96, 120, 128, 144, 160, 192, 240, 256, 320, 360, 384, 640, 720, 768, 960, 1440, 1920, 3840
Offset: 1

Author

Hal M. Switkay, Nov 20 2023

Keywords

Comments

Conway and Sloane identify 2 conjugacy classes of maximal finite irreducible subgroups of GL_5(Z). The 2 maximal groups are: 1) the wreath fifth power of the group of order 2, the automorphism group of Z^5, D5 and its dual, of order 3840; 2) the product of the symmetric group of degree 6 with the group of order 2, the automorphism group of the A5 lattice and its dual, with order 1440.

Crossrefs

Cf. A367463.

A367463 The orders, without repetition, of the subquotients of finite groups with irreducible representations in GL_4(Z).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 16, 18, 20, 24, 32, 36, 40, 48, 60, 64, 72, 96, 120, 128, 144, 192, 240, 288, 384, 576, 1152
Offset: 1

Author

Hal M. Switkay, Nov 18 2023

Keywords

Comments

Conway and Sloane identify 5 conjugacy classes of maximal finite irreducible subgroups of GL_4(Z). Of these, 2 are isomorphic to subgroups of other groups in the list. The 3 maximal groups are: 1) the Weyl group of F4, the automorphism group of the D4 lattice, with order 1152; 2) the wreath square of the dihedral group of order 12, the automorphism group of the (A2)^2 lattice, with order 288; 3) the product of the symmetric group of degree 5 with the group of order 2, the automorphism group of the A4 lattice (and its dual), with order 240.

Crossrefs

Cf. A018261.