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.

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

This page as a plain text file.
%I A083810 #4 Dec 05 2013 19:56:15
%S A083810 2,7,59,47,1699,22697,1180247,29962733,1038006719,411043979,
%T A083810 295951664941,439109442193,84309012901073,1566310690709,
%U A083810 399766531626388768981,71604415998366709,180443128315884106709
%N A083810 a(n) = f^(n) (n), where f(n) is the smallest prime == 1 mod n (cf. A034694).
%C A083810 Main diagonal of A083809.
%o A083810 (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 A083810 Cf. A034694, A083809.
%K A083810 nonn
%O A083810 1,1
%A A083810 _Amarnath Murthy_, May 08 2003
%E A083810 Edited, corrected and extended by _Klaus Brockhaus_, May 13 2003