|
%I #9 Jul 16 2015 23:34:56
%S 0,3,5,7,2,3,5,5,8,13,13,17,20,21,23,3,7,7,11,11,9,13,15,19,25,25,25,
%T 27,25,25,37,39,41,41,49,49,1,1,2,5,8,7,11,7,8,7,16,25,23,22,23,23,19,
%U 26,29,32,35,31,34,35,31,38,49,50,49,47,58,61,68,67,68,71,73,76,79,77,77
%N a(n) = (n-th prime) mod (n-th nonprime).
%C In the first 100000 terms, the integers {4, 36, 40, 54} are missing. - _Robert G. Wilson v_, Jul 23 2010
%e For n=4, 7 mod 8 = 7.
%p A179650 := proc(n) ithprime(n) mod A018252(n) ; end proc: seq(A179650(n),n=1..100) ; # _R. J. Mathar_, Jul 23 2010
%t NonPrime[n_Integer] := FixedPoint[n + PrimePi@# &, n + PrimePi@n]; f[n_] := Mod[Prime@n, NonPrime@n]; Array[f, 70] (* _Robert G. Wilson v_, Jul 23 2010 *)
%Y Cf. A000040, A018252.
%K nonn
%O 1,2
%A _Jason G. Wurtzel_, Jul 22 2010
%E More terms from _R. J. Mathar_, _Robert G. Wilson v_ and _Carl R. White_, Jul 23 2010
|
