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.

A070853 Smallest prime == 1 mod (9n).

This page as a plain text file.
%I A070853 #14 Dec 16 2023 11:00:28
%S A070853 19,19,109,37,181,109,127,73,163,181,199,109,937,127,271,433,307,163,
%T A070853 2053,181,379,199,829,433,1801,937,487,757,523,271,1117,577,1783,307,
%U A070853 631,1297,1999,2053,3511,1801,739,379,1549,397,811,829,1693,433,883
%N A070853 Smallest prime == 1 mod (9n).
%H A070853 Robert Price, <a href="/A070853/b070853.txt">Table of n, a(n) for n = 1..5000</a>
%o A070853 (PARI) for(n=1,80,s=1; while((isprime(s)*s-1)%(9*n)>0,s++); print1(s,","))
%Y A070853 Cf. A070846, A070847, A070848, A070849, A070850, A070851, A070852.
%Y A070853 Cf. A034694.
%K A070853 nonn
%O A070853 1,1
%A A070853 _Amarnath Murthy_, May 15 2002
%E A070853 Corrected and extended by _Benoit Cloitre_, May 18 2002