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.

Previous Showing 31-37 of 37 results.

A381311 Numbers whose powerful part (A057521) is a power of a prime with an even exponent >= 2.

Original entry on oeis.org

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

Views

Author

Amiram Eldar, Feb 19 2025

Keywords

Comments

Numbers k whose largest unitary divisor that is a square, A350388(k), is a prime power (A246655), or equivalently, A350388(k) is in A056798 \ {1}.
Numbers having exactly one non-unitary prime factor and its multiplicity is even.
Numbers whose prime signature (A118914) is of the form {1, 1, ..., 2*m} with m >= 1, i.e., any number (including zero) of 1's and then a single even number.
The asymptotic density of this sequence is (1/zeta(2)) * Sum_{p prime} p/((p-1)*(p+1)^2) = 0.24200684327095676029... .

Crossrefs

Programs

  • Mathematica
    q[n_] := Module[{e = ReverseSort[FactorInteger[n][[;;,2]]]}, EvenQ[e[[1]]] && (Length[e] == 1 || e[[2]] == 1)]; Select[Range[1000],q]
  • PARI
    isok(k) = if(k == 1, 0, my(e = vecsort(factor(k)[, 2], , 4)); !(e[1] % 2) && (#e == 1 || e[2] == 1));

A065985 Numbers k such that d(k) / 2 is prime, where d(k) = number of divisors of k.

Original entry on oeis.org

6, 8, 10, 12, 14, 15, 18, 20, 21, 22, 26, 27, 28, 32, 33, 34, 35, 38, 39, 44, 45, 46, 48, 50, 51, 52, 55, 57, 58, 62, 63, 65, 68, 69, 74, 75, 76, 77, 80, 82, 85, 86, 87, 91, 92, 93, 94, 95, 98, 99, 106, 111, 112, 115, 116, 117, 118, 119, 122, 123, 124, 125, 129, 133, 134
Offset: 1

Views

Author

Joseph L. Pe, Dec 10 2001

Keywords

Comments

Numbers whose sorted prime signature (A118914) is either of the form {2*p-1} or {1, p-1}, where p is a prime. Equivalently, disjoint union of numbers of the form q^(2*p-1) where p and q are primes, and numbers of the form r * q^(p-1), where p, q and r are primes and r != q. - Amiram Eldar, Sep 09 2024

Crossrefs

Numbers with exactly 2*p divisors: A030513 (p=2), A030515 (p=3), A030628 \ {1} (p=5), A030632 (p=7), A137485 (p=11), A137489 (p=13), A175744 (p=17), A175747 (p=19).

Programs

  • Mathematica
    Select[Range[1, 1000], PrimeQ[DivisorSigma[0, # ] / 2] == True &]
  • PARI
    n=0; for (m=1, 10^9, f=numdiv(m)/2; if (frac(f)==0 && isprime(f), write("b065985.txt", n++, " ", m); if (n==1000, return))) \\ Harry J. Smith, Nov 05 2009
    
  • PARI
    is(n)=n=numdiv(n)/2; denominator(n)==1 && isprime(n) \\ Charles R Greathouse IV, Oct 15 2015

A349699 Triangular numbers with exactly 10 divisors.

Original entry on oeis.org

496, 3321, 13203, 195625, 780625, 2883601, 11527201, 107186761, 407879641, 3487920481, 39155632561, 250123560121, 47622568443841, 95853663421561, 322876778328721, 403230060146161, 3034217580863041, 6333850463213521, 13292221046055841, 25335401515201441
Offset: 1

Views

Author

Jon E. Schoenfield, Nov 25 2021

Keywords

Comments

All terms are of the form p^4 * q, with primes p < q.
a(3) = 13203 = 3^4 * 163 is the only term for which q = 2*p^4 + 1; for all other terms, q is either 2*p^4 - 1 (e.g., a(1) = 496 = 2^4 * 31) or (p^4 + 1)/2 (e.g., a(2) = 3321 = 3^4 * 41).

Examples

			Table showing the first 20 terms and their prime factorizations. Because of the different relationships between the prime factors p and q for different terms (see Comments), neither the values of p nor those of q are nondecreasing.
.
   n               a(n) =   p^4 *         q
  --  -------------------------------------
   1                496 =   2^4 *        31
   2               3321 =   3^4 *        41
   3              13203 =   3^4 *       163
   4             195625 =   5^4 *       313
   5             780625 =   5^4 *      1249
   6            2883601 =   7^4 *      1201
   7           11527201 =   7^4 *      4801
   8          107186761 =  11^4 *      7321
   9          407879641 =  13^4 *     14281
  10         3487920481 =  17^4 *     41761
  11        39155632561 =  23^4 *    139921
  12       250123560121 =  29^4 *    353641
  13     47622568443841 =  47^4 *   9759361
  14     95853663421561 =  61^4 *   6922921
  15    322876778328721 =  71^4 *  12705841
  16    403230060146161 =  73^4 *  14199121
  17   3034217580863041 =  79^4 *  77900161
  18   6333850463213521 = 103^4 *  56275441
  19  13292221046055841 = 113^4 *  81523681
  20  25335401515201441 = 103^4 * 225101761
		

Crossrefs

Programs

  • Mathematica
    t[n_] := n*(n + 1)/2; Select[t /@ Range[10^5], DivisorSigma[0, #] == 10 &] (* Amiram Eldar, Nov 26 2021 *)
  • PARI
    select(x->(numdiv(x)==10), vector(10^5, k, k*(k+1)/2)) \\ Michel Marcus, Nov 26 2021

A350767 a(1)=1. Thereafter, a(n+1) is the least unused number k such that either d(j(n)) properly divides d(k) or d(k) properly divides d(j(n)), where j(n) = a(n)+1 and d is the divisor counting function A000005.

Original entry on oeis.org

1, 6, 8, 12, 10, 14, 2, 15, 48, 18, 20, 3, 28, 21, 5, 7, 11, 4, 22, 24, 32, 13, 17, 9, 19, 23, 26, 29, 27, 25, 30, 33, 31, 37, 40, 34, 41, 35, 49, 43, 47, 16, 38, 42, 39, 46, 44, 53, 51, 59, 45, 54, 56, 60, 50, 61, 66, 52, 55, 57, 67, 71, 58, 62, 72, 63, 192, 65
Offset: 1

Views

Author

David James Sycamore, Jan 14 2022

Keywords

Comments

If d(j(n)) is prime p then d(a(n+1)) must be properly divisible by p. In practice the proper divisor for computation of a(n+1) toggles between d(j(n)) and d(k).
Conjecture: This is a permutation of the positive integers. Numbers with the same number (tau) of divisors appear in their natural orders (e.g., primes, semiprimes, squares).
The plot, after the first few terms, resolves itself into points tightly packed on and around a straight line of slope 1, with exceptional points appearing as significant upward or downward "spikes".
When d(j(n)) is prime p appearing for the first time in the sequence J = {d(j(a(n)), n>=1}, then a(n+1) is the smallest number with 2p divisors, which produces a significantly large upward spike above the straight line (6, 12, 48, 192, 3072, 12288, ...).
When d(j(a(n)) is 2p, seen for the first time in J, then a(n+1) is the smallest number with p divisors, which produces a large downward spike, below the straight line (2, 4, 16, 64, 1024, 4096, ...).
The sequence of fixed points starts: 1, 46, 69, 74, 110, 140, 142, 152, 154, 178, ... apparently becoming denser as n increases.

Examples

			a(1)=1, so j(1)=2, d(j(1))=2, a prime, so we need the smallest unused k such that d(k) is properly divisible by 2, hence a(2)=6.
a(2)=6, j(2)=4, d(j(2))=3, a prime so we need the smallest unused k such that d(k) is properly divisible by 3, hence a(3)=8.
		

Crossrefs

Programs

Extensions

More terms from Michael De Vlieger, Jan 14 2022

A381316 Numbers whose powerful part (A057521) is a power of a prime with an exponent >= 3 (A246549).

Original entry on oeis.org

8, 16, 24, 27, 32, 40, 48, 54, 56, 64, 80, 81, 88, 96, 104, 112, 120, 125, 128, 135, 136, 152, 160, 162, 168, 176, 184, 189, 192, 208, 224, 232, 240, 243, 248, 250, 256, 264, 270, 272, 280, 296, 297, 304, 312, 320, 328, 336, 343, 344, 351, 352, 368, 375, 376, 378
Offset: 1

Views

Author

Amiram Eldar, Feb 19 2025

Keywords

Comments

First differs from A344653 and A345193 at n = 17: a(17) = 120 is not a term of these sequences.
Numbers whose prime signature (A118914) is of the form {1, 1, ..., m} with m >= 3, i.e., any number (including zero) of 1's and then a single number >= 3.
The asymptotic density of this sequence is (1/zeta(2)) * Sum_{p prime} 1/(p*(p^2-1)) = A369632 / A013661 = 0.13463358553764438661... .

Crossrefs

Programs

  • Mathematica
    q[n_] := Module[{e = ReverseSort[FactorInteger[n][[;; , 2]]]}, e[[1]] > 2 && (Length[e] == 1 || e[[2]] == 1)]; Select[Range[1000], q]
  • PARI
    isok(k) = if(k == 1, 0, my(e = vecsort(factor(k)[, 2], , 4)); e[1] > 2 && (#e == 1 || e[2] == 1));

A331669 List of distinct numbers that occur in A318366 (the Dirichlet convolution square of bigomega).

Original entry on oeis.org

0, 1, 2, 4, 8, 10, 12, 20, 24, 34, 35, 40, 48, 52, 56, 70, 72, 84, 95, 104, 112, 116, 120, 130, 156, 160, 164, 165, 168, 180, 189, 212, 220, 224, 238, 240, 258, 280, 284, 286, 300, 304, 322, 330, 344, 348, 352, 364, 380, 420, 438, 440, 455, 460, 464, 472, 477, 480
Offset: 1

Views

Author

Torlach Rush, Jan 23 2020

Keywords

Comments

There is a strong correlation between values of this function and values of other arithmetic functions. In other words, a(n) correlates to a single distinct value from one or more of the arithmetic functions.
Terms of this sequence select from the positive integers as follows:
A318366(k) = a(1), 1 followed by the primes (A008578).
A318366(k) = A008836(k) = A001221(k) = a(2), primes squared (A001248).
A318366(k) = A001221(k) = a(3), squarefree semiprimes (A006881).
A318366(k) = A000005(k) = a(4), primes cubed (A030078).
A318366(k) = a(5), a prime squared times a prime (A054753).
A318366(k) = a(6), primes to the fourth power (A030514).
A318366(k) = a(7), sphenic numbers (A007304).
A318366(k) = a(8), union of A050997 and A065036.
A318366(k) = a(9), squarefree semiprimes squared (A085986).
A318366(k) = a(10), product of four primes, three distinct (A085987).
A318366(k) = a(11), primes to the sixth power (A030516).
A318366(k) = a(12), product of prime to fourth power and a different prime (A178739).
A318366(k) = a(13), product of four distinct primes (A046386).
...

Examples

			0 is a term because the only divisors of a prime (p) are 1 and a prime itself and bigomega(1) * bigomega(p) + bigomega(p) * bigomega(1) = 0 * 1 + 1 * 0 = 0.
1 is a term because a prime squared gives bigomega(1) * bigomega(p^2) + bigomega(p) * bigomega(p) + bigomega(p^2) * bigomega(1) = 0 * 2 + 1 * 1 + 2 * 0 = 1.
		

Crossrefs

Cf. also A101296.

Extensions

More terms, using A318366 extended b-file, from Michel Marcus, Jan 24 2020

A349931 Numbers that have an equal number of factorizations of even and odd length in both unordered and ordered manners.

Original entry on oeis.org

4, 9, 12, 18, 20, 25, 28, 44, 45, 48, 49, 50, 52, 63, 68, 72, 75, 76, 80, 92, 98, 99, 108, 112, 116, 117, 121, 124, 147, 148, 153, 162, 164, 169, 171, 172, 175, 176, 180, 188, 192, 200, 207, 208, 212, 236, 240, 242, 244, 245, 252, 261, 268, 272, 275, 279, 284, 289, 292, 300
Offset: 1

Views

Author

Tian Vlasic, Dec 05 2021

Keywords

Comments

Intersection of A319240 and A013929, i.e., terms of A319240 that are not squarefree.
A319240 lists the numbers that have an equal number of factorizations of even and odd length in an unordered manner.
A013929 lists the numbers that have an equal number of factorizations of even and odd length in an ordered manner.
There are infinitely many terms in this sequence since p^2 is always such a number for prime p.
Out of all numbers of the form p^k with p prime (listed in A000961), only the numbers of the form p^2 (A001248) are terms.
Out of all numbers of the form p*q^k, p and q prime, only the numbers of the form p*q (A006881), p*q^2 (A054753), p*q^4 (A178739) and p*q^6 (A189987) are terms.
Similar methods can be applied to all prime signatures.
Wilf's conjecture is equivalent to the statement that this sequence is the set difference of A319240 and A006881.

Examples

			12 = 2*6 = 3*4 = 2*2*3 (unordered) has an equal number (2) of even-length factorizations and odd-length factorizations, and 12 = 2*6 = 6*2 = 3*4 = 4*3 = 2*2*3 = 2*3*2 = 3*2*2 (ordered) has an equal number (4) of even-length factorizations and odd-length factorizations.
		

References

  • Amarnath Murthy and Charles Ashbacher, Generalized Partitions and Some New Ideas on Number Theory and Smarandache Sequences, Hexis, Phoenix; USA 2005.

Crossrefs

Programs

  • PARI
    f(n, m=n, k=0) = if(1==n, (-1)^k, my(s=0); fordiv(n, d, if((d>1)&&(d<=m), s += f(n/d, d, k+1))); (s)); \\ A316441
    isok(m) = (f(m) == 0) && ! issquarefree(m); \\ Michel Marcus, Dec 09 2021
Previous Showing 31-37 of 37 results.