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!)
A125075 Consider the smallest k such that prime(k) > n*composite(k). Sequence gives composite(k). 1

%I #2 Mar 30 2012 17:27:49

%S 10,26,57,130,304,720,1653,3933,9489,22954,55860,136705,337951,843306,

%T 2110436,5311239,13432130,34143472,87069907,222858046,572210219,

%U 1473600000,3804733479

%N Consider the smallest k such that prime(k) > n*composite(k). Sequence gives composite(k).

%C a(n) = A002808(A073459(n)).

%e The smallest k such that prime(k) > 2*composite(k), i.e. A073459(2), is 16; the sixteenth composite, i.e. A002808(16), is 26. Hence a(2) = 26.

%Y Cf. A000040, A002808, A073459, A093864.

%K nonn

%O 1,1

%A _Klaus Brockhaus_, Nov 19 2006

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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)