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.

A057851 Primes p whose order of primeness A078442(p) is at least 9.

This page as a plain text file.
%I A057851 #29 Nov 17 2024 20:35:13
%S A057851 52711,648391,9737333,37139213,174440041,326851121,718064159,
%T A057851 997525853,1559861749,2724711961,3657500101,5545806481,7069067389,
%U A057851 8012791231,9672485827,12501968177,16123689073,16917026909,22742734291
%N A057851 Primes p whose order of primeness A078442(p) is at least 9.
%H A057851 Charles R Greathouse IV, <a href="/A057851/b057851.txt">Table of n, a(n) for n = 1..10000</a> (first 1381 terms from Robert G. Wilson v)
%H A057851 N. Fernandez, <a href="http://www.borve.org/primeness/FOP.html">An order of primeness, F(p)</a>
%H A057851 N. Fernandez, <a href="/A006450/a006450.html">An order of primeness</a> [cached copy, included with permission of the author]
%t A057851 Nest[ Prime, Range[35], 9] (* _Robert G. Wilson v_, Mar 15 2004 *)
%o A057851 (PARI) list(lim)=my(v=List(), q, r, s, t, u, vv, w, x); forprime(p=2, lim, if(isprime(q++) && isprime(r++) && isprime(s++) && isprime(t++) && isprime(u++) && isprime(vv++) && isprime(w++) && isprime(x++), listput(v, p))); Vec(v) \\ _Charles R Greathouse IV_, Feb 19 2017
%Y A057851 Cf. A078442, A000040, A006450, A038580, A049090, A049203, A049202, A057849, A057850, A057847, A058332, A093047.
%K A057851 nonn
%O A057851 1,1
%A A057851 _Robert G. Wilson v_, Nov 10 2000
%E A057851 Name clarified by _Andrew Howroyd_, Nov 17 2024