This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A065863 #18 Dec 30 2024 12:54:30
%S A065863 0,0,0,1,1,1,2,3,3,5,1,2,6,3,2,3,9,6,1,11,8,9,13,14,1,16,13,12,14,13,
%T A065863 7,5,5,1,5,1,7,7,5,5,11,7,17,13,11,7,19,25,23,19,17,17,19,23,23,23,23,
%U A065863 19,25,23,25,29,37,35,31,29,43,43,47,43,47,47,3,2,1,53,53,55,2,3,6,1,11,6
%N A065863 Remainder when n-th prime is divided by the number of nonprimes not exceeding n.
%H A065863 Harry J. Smith, <a href="/A065863/b065863.txt">Table of n, a(n) for n = 1..1000</a>
%F A065863 a(n) = prime(n) mod (n - pi(n)) = A000040(n) mod A062298(n).
%e A065863 For n=25, prime(25)=97, n - pi(n) = 25 - 9 = 16, a(25)=1 because 97 = 6*16 + 1.
%t A065863 Table[Mod[Prime[n],n-PrimePi[n]],{n,90}] (* _Harvey P. Dale_, Aug 04 2015 *)
%o A065863 (PARI) a(n) = { prime(n)%(n - primepi(n)) } \\ _Harry J. Smith_, Nov 02 2009
%Y A065863 Cf. A000040, A062298, A065858-A065864, A065134, A004648, A065133, A065134.
%K A065863 nonn
%O A065863 1,7
%A A065863 _Labos Elemer_, Nov 26 2001