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 A084403 #27 Nov 29 2014 13:27:58
%S A084403 2,5,11,23,47,191,383,1151,6911,27647,138239,691199,3455999,34559999,
%T A084403 138239999,414719999,2073599999,16588799999,364953599999,
%U A084403 4744396799999,66421555199999,132843110399999,664215551999999,3321077759999999
%N A084403 Primes arising in A084402. a(n) = n-th partial product of A084402 - 1.
%C A084403 This is a sequence similar to A090552 but here with primes: a(1) = 2; for n>=2, a(n) is the smallest prime p for which p+1 is a multiple of a(n-1) + 1. - _J. M. Bergot_, Oct 16 2014, revised by _Wolfdieter Lang_, Nov 24 2014
%e A084403 3-1=2, 3*2-1=5, 3*2*2-1=11, etc. are the primes arising in A084402.
%o A084403 (PARI) lista(nn) = {v = vector(nn); for (n=1, nn, v[n] = 2; while (! isprime(p=prod(i=1, n, v[i])-1), v[n]++); print1(p, ", "););} \\ _Michel Marcus_, Oct 31 2014
%Y A084403 Cf. A084402.
%K A084403 nonn
%O A084403 1,1
%A A084403 _Amarnath Murthy_, May 31 2003
%E A084403 More terms from _David Wasserman_, Dec 22 2004