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,8

References

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

Links

Table of n, a(n) for n=2..89.

Crossrefs

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

Sequence in context: A135592 A022912 A318955 * A022922 A239141 A377758

Adjacent sequences: A173880 A173881 A173882 * A173884 A173885 A173886

Keyword

nonn

Author

Artur Jasinski, Mar 01 2010

Extensions

Edited, corrected and extended by Arkadiusz Wesolowski, Jan 19 2013

Status

approved