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.

A093864 Consider the least k such that prime(k) > n*composite(k). Sequence gives prime(k).

This page as a plain text file.
%I A093864 #7 Dec 05 2013 19:56:48
%S A093864 11,53,173,521,1523,4327,11579,31469,85411,229547,614477,1640461,
%T A093864 4393369,11806297,31656553,84979847,228346229,614582509,1654328267,
%U A093864 4457160931,12016414601,32419200013,87508870037,236325429049,638490906857,1725782162981,4666340800001
%N A093864 Consider the least k such that prime(k) > n*composite(k). Sequence gives prime(k).
%C A093864 a(n) = prime(A073459(n)).
%e A093864 a(2) = 53 as 53 > 2*26 where 53 and 26 are respectively the 16th prime and composite numbers.
%o A093864 (PARI) nextcomposite(k)=if(k<3,4,if(isprime(k),k+1,k));
%o A093864 (PARI) p=2;q=4;for(n=1,19, while(p<=n*q,p=nextprime(p+1);q=nextcomposite(q+1));print1(p,","));
%Y A093864 Cf. A002808, A000040, A073459, A125075.
%K A093864 nonn
%O A093864 1,1
%A A093864 _Amarnath Murthy_, Apr 19 2004
%E A093864 Terms a(4) to a(19) and PARI code from _Klaus Brockhaus_, Apr 26 2004
%E A093864 Terms a(20) to a(23) from _Klaus Brockhaus_, Nov 19 2006
%E A093864 More terms from _David Wasserman_, Apr 20 2007