login
a(n) = f^(n) (n), where f(n) is the smallest prime == 1 mod n (cf. A034694).
2

%I #4 Dec 05 2013 19:56:15

%S 2,7,59,47,1699,22697,1180247,29962733,1038006719,411043979,

%T 295951664941,439109442193,84309012901073,1566310690709,

%U 399766531626388768981,71604415998366709,180443128315884106709

%N a(n) = f^(n) (n), where f(n) is the smallest prime == 1 mod n (cf. A034694).

%C Main diagonal of A083809.

%o (PARI 2.1.3) for(n=1,18,q=n; for(k=1,n,m=1; while(!isprime(p=m*q+1,1),m++); q=p); print1(q,","))

%Y Cf. A034694, A083809.

%K nonn

%O 1,1

%A _Amarnath Murthy_, May 08 2003

%E Edited, corrected and extended by _Klaus Brockhaus_, May 13 2003