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.
%I A200997 #16 Jan 22 2013 18:38:41 %S A200997 2,2,5,5,5,5,7,11,11,11,13,13,13,13,13,13,13,13,17,17,17,19,23,23,23, %T A200997 23,23,29,29,29,29,29,31,37,41,41,41,43,43,43,43,43,47,47,47,47,47,53, %U A200997 53,53,59,59,59,59,59,61,61,61,61,61,61,61,67,67,67,67,67,71,71,71,73,73,73,73,73,73,73,73,73,73,73,73,73,79,83,83,83,89 %N A200997 Terms of A135506 sorted (after removing the 1's). %C A200997 Terms of the sequence are primes and all primes except 3 appear finitely many times. p>=5 occurs 1 time iff 2p-1 is prime (cf. A005382). p>=11 occurs 3 times iff 4p-1 is prime (cf. A062737). In general p occurs 2m-1 times iff 2mp-1 is prime and 2ip-1 is composite for i=1,2,3,...,m-1. %o A200997 (PARI) v=[];u1=1;for(n=2,1000,u2=u1+lcm(n,u1);r=u1;u1=u2;if(u2/r-1>1,v=concat(v,[u2/r-1]);));w=vecsort(v);a(n)=w[n]; %K A200997 nonn %O A200997 1,1 %A A200997 _Benoit Cloitre_, Jan 08 2013