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!)
A173883 a(n) = number of iterations in the sequence of classes of prime numbers for prime(n). 0

%I #20 Jan 22 2013 12:49:16

%S 0,0,0,0,0,1,1,2,2,2,3,2,2,3,2,2,2,4,4,4,4,4,4,4,4,4,4,3,4,4,4,4,5,4,

%T 4,4,4,4,4,4,4,4,4,4,4,4,8,8,8,8,6,5,4,4,4,4,4,6,4,5,4,5,4,5,5,4,4,4,

%U 4,5,6,5,4,6,4,4,4,4,4,4,4,8,8,8,8,8,8,8

%N a(n) = number of iterations in the sequence of classes of prime numbers for prime(n).

%D Alexander S. Karpenko, Lukasiewicz's Logics and Prime Numbers, Luniver Press, Beckington, 2006, pp. 98-102.

%Y Cf. A058340, A096827, A175177, A175178, A175179.

%K nonn

%O 2,8

%A _Artur Jasinski_, Mar 01 2010

%E Edited, corrected and extended by _Arkadiusz Wesolowski_, Jan 19 2013

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 25 09:30 EDT 2024. Contains 371967 sequences. (Running on oeis4.)