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.

A320628 Products of primes of nonprime index.

Original entry on oeis.org

1, 2, 4, 7, 8, 13, 14, 16, 19, 23, 26, 28, 29, 32, 37, 38, 43, 46, 47, 49, 52, 53, 56, 58, 61, 64, 71, 73, 74, 76, 79, 86, 89, 91, 92, 94, 97, 98, 101, 103, 104, 106, 107, 112, 113, 116, 122, 128, 131, 133, 137, 139, 142, 146, 148, 149, 151, 152, 158, 161, 163
Offset: 1

Views

Author

Gus Wiseman, Oct 18 2018

Keywords

Comments

The index of a prime number n is the number m such that n is the m-th prime.
The asymptotic density of this sequence is Product_{p in A006450} (1 - 1/p) = 1/(Sum_{n>=1} 1/A076610(n)) < 1/3. - Amiram Eldar, Feb 02 2021

Examples

			The sequence of terms begins:
   1 = 1
   2 = prime(1)
   4 = prime(1)^2
   7 = prime(4)
   8 = prime(1)^3
  13 = prime(6)
  14 = prime(1)*prime(4)
  16 = prime(1)^4
  19 = prime(8)
  23 = prime(9)
  26 = prime(1)*prime(6)
  28 = prime(1)^2*prime(4)
  29 = prime(10)
  32 = prime(1)^5
  37 = prime(12)
  38 = prime(1)*prime(8)
  43 = prime(14)
  46 = prime(1)*prime(9)
  47 = prime(15)
  49 = prime(4)^2
  52 = prime(1)^2*prime(6)
  53 = prime(16)
  56 = prime(1)^3*prime(4)
  58 = prime(1)*prime(10)
  61 = prime(18)
  64 = prime(1)^6
  71 = prime(20)
  73 = prime(21)
  74 = prime(1)*prime(12)
  76 = prime(1)^2*prime(8)
  79 = prime(22)
  86 = prime(1)*prime(14)
  89 = prime(24)
  91 = prime(4)*prime(6)
  92 = prime(1)^2*prime(9)
  94 = prime(1)*prime(15)
  97 = prime(25)
  98 = prime(1)*prime(4)^2
		

Crossrefs

Complement of A331386.
Positions of zeros in A257994.
Primes of prime index are A006450.
Primes of nonprime index are A007821.
Products of primes of prime index are A076610.
Products of primes of nonprime index are this sequence.
The number of prime prime indices is given by A257994.
The number of nonprime prime indices is given by A330944.

Programs

  • Mathematica
    Select[Range[100],And@@Not/@PrimeQ/@PrimePi/@First/@FactorInteger[#]&]

A331386 Numbers with at least one prime prime index.

Original entry on oeis.org

3, 5, 6, 9, 10, 11, 12, 15, 17, 18, 20, 21, 22, 24, 25, 27, 30, 31, 33, 34, 35, 36, 39, 40, 41, 42, 44, 45, 48, 50, 51, 54, 55, 57, 59, 60, 62, 63, 65, 66, 67, 68, 69, 70, 72, 75, 77, 78, 80, 81, 82, 83, 84, 85, 87, 88, 90, 93, 95, 96, 99, 100, 102, 105, 108
Offset: 1

Views

Author

Gus Wiseman, Jan 17 2020

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
The asymptotic density of this sequence is 1 - Product_{p in A006450} (1 - 1/p) = 1 - 1/(Sum_{n>=1} 1/A076610(n)) > 2/3. - Amiram Eldar, Feb 02 2021

Examples

			The sequence of terms together with their prime indices begins:
    3: {2}
    5: {3}
    6: {1,2}
    9: {2,2}
   10: {1,3}
   11: {5}
   12: {1,1,2}
   15: {2,3}
   17: {7}
   18: {1,2,2}
   20: {1,1,3}
   21: {2,4}
   22: {1,5}
   24: {1,1,1,2}
   25: {3,3}
   27: {2,2,2}
   30: {1,2,3}
   31: {11}
   33: {2,5}
   34: {1,7}
		

Crossrefs

Complement of A320628.
Positions of terms > 0 in A257994.
Positions of terms > 1 in A295665.
Primes of prime index are A006450.
Primes of nonprime index are A007821.
Products of primes of prime index are A076610.
Products of primes of nonprime index are A320628.
The number of nonprime prime indices is given by A330944.

Programs

Formula

A257994(a(n)) > 0.

A295666 a(n) = Product_{d|n, gcd(d,n/d) is prime} gcd(d,n/d).

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 4, 1, 1, 1, 4, 1, 9, 1, 4, 1, 1, 1, 16, 5, 1, 9, 4, 1, 1, 1, 4, 1, 1, 1, 36, 1, 1, 1, 16, 1, 1, 1, 4, 9, 1, 1, 16, 7, 25, 1, 4, 1, 81, 1, 16, 1, 1, 1, 16, 1, 1, 9, 4, 1, 1, 1, 4, 1, 1, 1, 144, 1, 1, 25, 4, 1, 1, 1, 16, 9, 1, 1, 16, 1, 1, 1, 16, 1, 81, 1, 4, 1, 1, 1, 16, 1, 49, 9, 100, 1, 1, 1, 16, 1
Offset: 1

Views

Author

Antti Karttunen, Nov 26 2017

Keywords

Examples

			For n = 12, with divisors 1, 2, 3, 4, 6, 12, we select from the sequence gcd(1,12/1), gcd(2,12/2), gcd(3,12/3), gcd(4,12/4), gcd(6,12/6), gcd(12,12/12) = 1, 2, 1, 1, 2, 1 only those that are primes, namely the two 2's, and form their product, thus a(12) = 2*2 = 4.
For n = 100, with divisors 1, 2, 4, 5, 10, 20, 25, 50, 100, we select from the sequence gcd(1,100/1), gcd(2,100/2), gcd(4,100/4), gcd(5,100/5), gcd(10,100/10), gcd(20,100/20), gcd(25,100/25), gcd(50,100/50), gcd(100,100/100) = 1, 2, 1, 5, 10, 5, 1, 2, 1, only those that are primes, namely 2, 5, 5 and 2, thus a(100) = 2*5*5*2 = 100.
		

Crossrefs

Programs

  • Mathematica
    a[n_]:=Product[GCD[i,n/i]^Boole[PrimeQ[GCD[i,n/i]]],{i,Divisors[n]}]; Array[a,105] (* Stefano Spezia, Feb 20 2024 *)
  • PARI
    A295666(n) = { my(m=1,p); fordiv(n, d, p = gcd(d, n/d); if(isprime(p), m *= p)); m; };

Formula

a(n) = Product_{d|n} gcd(d,n/d)^A010051(gcd(d,n/d)).
a(n) = A295665(A294876(n)).
Other identities. For all n >= 1:
A001221(a(n)) = A056170(n) = A001221(A003557(n)).
Showing 1-3 of 3 results.