The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156053 Let m = A002445(n); then a(n) = largest member of A001359 (the lesser twin primes sequence) <= m. 0
5, 29, 41, 2729, 137, 14321, 281, 3404309, 33329, 641, 4206929, 1366529, 281189, 7589, 625169, 5009, 2081, 63029, 5477, 2657, 2801, 15269, 19469, 25997, 49169, 11489, 23909, 289109, 14009, 129629, 32909, 3254729, 88577309, 93809, 412589 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Wikimedia Commons, Alternate plot
PROG
(PARI) \\ uses Pari functions ispseudoprime, denominator, and list \\ tp2cnt =count of adjacent, unique twin primes (lower) \\ p2cnt = count of unique adjacent primes \\ N = Bernoulli # maxx= max N idx*=list pointers \\ u=array of adj. unique TP u2=array of adj. unique primes cnt=0; pcnt=0; n=1; opcnt=0; plcnt=0; phcnt=0; tpcnt=0; otpcnt=0; tp2cnt=0; p2cnt=0; limmit=429000001; \\4E8 idx=1; \\init idx2=1;
\\init if(maxx<2, maxx=2); if(maxx>200000, maxx=200000); print ("enforced n max = ", maxx); u=listcreate(500); \\unique entries < 10% TP u2=listcreate(5000); \\unique entries < 50% while(n<maxx+1, if(bernfrac(n)==0, n++) ; \\guard against 0 division m=abs(denominator(bernfrac(n)) ); p=m-1; q=m+1;
\\ we check to either side cnt++; if( ispseudoprime(p)==1, plcnt++ ); if( ispseudoprime(q)==1, phcnt++ ); if( ispseudoprime(q)==1 || ispseudoprime(p)==1, pcnt++ ); if( ispseudoprime(q)==1 && ispseudoprime(p)==1, tpcnt++ ); if( tpcnt>otpcnt, print("TP! @ ", n, " ", q, " "
\\IF.FOR, IF if(p>0, listput(u, p, idx); tp2cnt++ ); if(p>0, idx++) ); \\ end IF if( pcnt>opcnt, if(p>limmit, p=0); \\lower if(ispseudoprime(p)==0, p=0); if(p>0, for(z=1, idx2-1, if(p==u2[z], p=0); ); ); if(p>0, listput(u2, p, idx2); p2cnt++); if(p>0, idx2++); if(q>limmit, q=0);
\\upper if(ispseudoprime(q)==0, q=0); if(q>0, for(z=1, idx2-1, if(q==u2[z], q=0); ); ); if(q>0, listput(u2, q, idx2); p2cnt++); if(q>0, idx2++) ); \\ end IF opcnt=pcnt; otpcnt=tpcnt; n++ ); \\end WHILE if(cnt>0, print(2.*p2cnt/cnt) ); \\reflect every other (n.z.) print ("TP count = ", tp2cnt ); print ("enforced n max = ", maxx);
CROSSREFS
Sequence in context: A107151 A340154 A117746 * A081116 A192090 A268673
KEYWORD
easy,nonn
AUTHOR
Bill McEachen, Feb 02 2009
EXTENSIONS
Edited by N. J. A. Sloane, Oct 21 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 17 18:36 EDT 2024. Contains 373463 sequences. (Running on oeis4.)