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!)
A025011 a(1) = 7; a(n+1) = a(n)-th composite. 5

%I #10 May 09 2018 23:00:27

%S 7,14,24,36,52,74,100,133,174,222,284,356,442,543,665,805,969,1161,

%T 1383,1643,1939,2278,2665,3108,3614,4189,4840,5577,6412,7348,8400,

%U 9584,10912,12392,14049,15903,17963,20253,22801,25624,28757,32214,36044,40273,44943

%N a(1) = 7; a(n+1) = a(n)-th composite.

%H Chai Wah Wu, <a href="/A025011/b025011.txt">Table of n, a(n) for n = 1..901</a>

%t g[ n_Integer ] := (k = n + PrimePi[ n ] + 1; While[ k - PrimePi[ k ] - 1, k++ ]; k); NestList[ g, 7, 45 ]

%t With[{cmps=Select[Range[100000],CompositeQ]},NestList[cmps[[#]]&,7,50]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Jul 08 2017 *)

%Y Cf. A006508, A025010.

%K nonn

%O 1,1

%A _David W. Wilson_

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 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)