Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A173883
a(n) = number of iterations in the sequence of classes of prime numbers for prime(n).
0
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, 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, 4, 5, 6, 5, 4, 6, 4, 4, 4, 4, 4, 4, 4, 8, 8, 8, 8, 8, 8, 8
OFFSET
2,8
REFERENCES
Alexander S. Karpenko, Lukasiewicz's Logics and Prime Numbers, Luniver Press, Beckington, 2006, pp. 98-102.
CROSSREFS
KEYWORD
nonn
AUTHOR
Artur Jasinski, Mar 01 2010
EXTENSIONS
Edited, corrected and extended by Arkadiusz Wesolowski, Jan 19 2013
STATUS
approved