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 A032448 #16 Jun 21 2014 22:32:07
%S A032448 3,2,19,13,43,103,67,37,137,173,61,73,163,257,281,211,353,487,401,283,
%T A032448 1021,157,331,1423,193,1009,617,641,653,677,761,523,547,277,1489,1811,
%U A032448 313,977,1669,691,1789,1447,4201,1543,787,397,421,1783,907,457
%N A032448 Smallest prime == -1 modulo prime(n).
%C A032448 It appears that a(n) <= prime(n)^2-1, where prime(n) = A000040(n) is the n-th prime; see A035095 for a related conjecture. If correct, this implies A006530(a(n)+1)=prime(n), which in turn implies that there are no duplicated values in the sequence.
%H A032448 Reinhard Zumkeller, <a href="/A032448/b032448.txt">Table of n, a(n) for n = 1..1000</a>
%t A032448 f[n_] := Block[{p = Prime@ n}, r = p - 1; While[ !PrimeQ@ r, r += p]; r]; Array[f, 50] (* _Robert G. Wilson v_, Jun 20 2014 *)
%o A032448 (PARI) a(n) = {prn = prime(n); p = 2; while(p % prn != prn - 1, p = nextprime(p+1)); p;} \\ _Michel Marcus_, Aug 04 2013
%o A032448 (Haskell)
%o A032448 a032448 n = head [q | q <- a000040_list, let p = a000040 n,
%o A032448 q `mod` p == p - 1]
%o A032448 -- _Reinhard Zumkeller_, Aug 08 2013
%Y A032448 Cf. A035095, A088732, A006530, A000040.
%K A032448 nonn
%O A032448 1,1
%A A032448 _Reinhard Zumkeller_, Jun 25 2003
%E A032448 Edited by _Franklin T. Adams-Watters_, Jun 21 2010