# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a048199
Showing 1-1 of 1

%I A048199 #9 Aug 25 2013 03:21:34
%S A048199 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,
%T A048199 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,
%U A048199 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
%N A048199 Distance of primes to next odd multiple of 5 (where n mod 10 = 5),
%e A048199 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.
%o A048199 (PARI) a(n) = {p = prime(n); k = 0; while ((p+k) % 10 != 5, k++); k;} \\ _Michel Marcus_, Aug 25 2013
%Y A048199 Cf. A048198, A007652.
%K A048199 easy,nonn
%O A048199 1,1
%A A048199 _Enoch Haga_

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE