A268479 For p = prime(n), number of primes (including p) in the trajectory of p under the procedure in A244550, also allowing the Wieferich prime 2, that are not terms of a repeating cycle.

0, 0, 1, 2, 0, 1, 1, 1, 2, 1, 3, 1, 1, 2

Offset: 1

Author

Felix Fröhlich, Feb 05 2016

Keywords

• nonn
• hard
• more

Comments

a(15) is unknown, since there is no known Wieferich prime to base 47 (cf. Fischer link).

Examples

			The trajectory of 31 starts 31, 7, 5, 2, 1093, 2, 1093, 2, 1093,  ...., entering a repeating cycle consisting of the terms 2 and 1093. There are three terms before the cycle, so a(11) = 3.
		

Links

• R. Fischer, Thema: Fermatquotient B^(P-1) == 1 (mod P^2)

Crossrefs

Cf. A244550, A252801, A252802, A252812.