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

A283458 Primes for which A049076(p) = 14.

Original entry on oeis.org

3657500101, 12055296811267, 156740126985437, 575411103069067, 966399998477597, 1841803943951113, 4176603711876241, 6373890505436101, 7910004791442043, 10613343313176589, 15000987504638299, 23825707567607467, 25462803625208449, 30634679101122821, 41400950264534519, 49969246522326097
Offset: 1

Views

Author

Robert G. Wilson v, Mar 08 2017

Keywords

Comments

Also used Kim Walisch's primecount.

Crossrefs

Programs

  • Mathematica
    Nest[Prime, Select[Range[7], ! PrimeQ[#] &], 13]

Formula

a(n) = A000040(A093046(n)).

A283459 Primes for which A049076(p) = 15.

Original entry on oeis.org

88362852307, 392654585611999, 5519908106212193, 21034688742654437, 35843152090509943, 69532764058102673, 161191749822468689, 248761474969923757, 310467261969020581, 419776921940182991, 598644471430113247, 962125183414225879, 1029970322316321083, 1244984735583648473, 1695313841631390713
Offset: 1

Views

Author

Robert G. Wilson v, Mar 08 2017

Keywords

Comments

Also used Kim Walisch's primecount.

Crossrefs

Programs

  • Mathematica
    Nest[Prime, Select[Range[3], ! PrimeQ[#] &], 14]

Formula

a(n) = A000040(A283458(n)).

A318554 a(n) is the smallest prime number having order of primeness = prime(n).

Original entry on oeis.org

3, 5, 31, 709, 9737333, 3657500101, 2586559730396077, 4123221751654370051, 28785866289100396890228041
Offset: 1

Views

Author

David James Sycamore, Aug 27 2018

Keywords

Comments

Let F(k) denote A049076(k). The list of primes p such that F(p) = n begins with q, the smallest prime to have prime index in each of n-1 successive primeth iterations, finally taking nonprime index 1 at the n-th iteration. All other members p such that F(p) = n are primes > q which also take a nonprime index at the n-th iteration. The reverse sequence of associated indices for q = prime(n) gives successive terms of the primeth recurrence 1,2,3,5,... until reaching A007097(prime(n)) = a(n).

Examples

			The sequence of primes with order of primeness F(p) = prime(1) = 2 begins 3,17,41,67,...
so a(1)=3. Likewise, F(p) = prime(2) = 3 begins 5,59,179,... so a(2)=5.
		

Crossrefs

Formula

a(n) = A007097(prime(n)); n >= 1.
Previous Showing 31-33 of 33 results.