A048199 Distance of primes to next odd multiple of 5 (where n mod 10 = 5).

3, 2, 0, 8, 4, 2, 8, 6, 2, 6, 4, 8, 4, 2, 8, 2, 6, 4, 8, 4, 2, 6, 2, 6, 8, 4, 2, 8, 6, 2, 8, 4, 8, 6, 6, 4, 8, 2, 8, 2, 6, 4, 4, 2, 8, 6, 4, 2, 8, 6, 2, 6, 4, 4, 8, 2, 6, 4, 8, 4, 2, 2, 8, 4, 2, 8, 4, 8, 8, 6, 2, 6, 8, 2, 6, 2, 6, 8, 4, 6, 6, 4, 4, 2, 6, 2, 6, 8, 4, 2, 8, 6, 8, 4, 6, 2, 6, 4, 2, 4, 8, 8, 2, 6, 4

Offset: 1

Author

Enoch Haga

Keywords

• easy
• nonn

Examples

			Take first prime 2, subtract from 5: 5-2=3, distance to 5; take 5-5 = 0; or 4th term, 15-7=8. Sequence may be converted to distance to nearest value of n (absolute value, where n mod 10 = 5) by changing all 8's to 2's and all 6's to 4's.
		

Crossrefs

Cf. A048198, A007652.

Programs

PARI

a(n) = {p = prime(n); k = 0; while ((p+k) % 10 != 5, k++); k;} \\ Michel Marcus, Aug 25 2013