cp's OEIS Frontend

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.

A093871 a(n) is the n-th prime = -1 (mod n).

This page as a plain text file.
%I A093871 #10 Nov 08 2019 11:22:06
%S A093871 2,5,11,19,89,41,181,127,251,199,571,227,1013,433,599,751,2039,593,
%T A093871 2089,859,1637,1429,4001,1103,4049,2053,3779,2267,6263,1499,6571,3583,
%U A093871 5279,3943,6089,2879,11321,4597,7331,4919,15497,3779,15307,6599,8009,7681
%N A093871 a(n) is the n-th prime = -1 (mod n).
%C A093871 Main diagonal of A093870.
%H A093871 Robert Israel, <a href="/A093871/b093871.txt">Table of n, a(n) for n = 1..10000</a>
%p A093871 f:= proc(n) local p,count;
%p A093871   count:= 0;
%p A093871   for p from n-1 by n do
%p A093871     if isprime(p) then
%p A093871        count:= count+1;
%p A093871        if count = n then return p fi
%p A093871     fi
%p A093871   od;
%p A093871 end proc:
%p A093871 map(f, [$1..100]); # _Robert Israel_, Nov 08 2019
%Y A093871 Cf. A077317, A038700, A093870.
%K A093871 nonn
%O A093871 1,1
%A A093871 _Amarnath Murthy_, Apr 20 2004
%E A093871 Edited and extended by _Franklin T. Adams-Watters_, Aug 29 2006