A173883 a(n) = number of iterations in the sequence of classes of prime numbers for prime(n).
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
Keywords
References
- Alexander S. Karpenko, Lukasiewicz's Logics and Prime Numbers, Luniver Press, Beckington, 2006, pp. 98-102.
Extensions
Edited, corrected and extended by Arkadiusz Wesolowski, Jan 19 2013