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.

A368201 Least k such that 9*n*k+1 is a prime.

This page as a plain text file.
%I A368201 #24 Dec 16 2023 18:47:54
%S A368201 2,1,4,1,4,2,2,1,2,2,2,1,8,1,2,3,2,1,12,1,2,1,4,2,8,4,2,3,2,1,4,2,6,1,
%T A368201 2,4,6,6,10,5,2,1,4,1,2,2,4,1,2,4,2,2,14,1,2,2,4,1,2,1,14,2,4,1,2,3,
%U A368201 12,1,6,1,2,2,6,3,6,3,6,5,2,3,2,1,6,1,2
%N A368201 Least k such that 9*n*k+1 is a prime.
%H A368201 Robert Price, <a href="/A368201/b368201.txt">Table of n, a(n) for n = 1..5000</a>
%t A368201 A368201 = {};
%t A368201 Do[k=1; While[!PrimeQ[9 n k+1], k++]; AppendTo[A368201,k], {n,85}];
%t A368201 A368201
%o A368201 (PARI) a(n) = my(k=1); while (!isprime(9*n*k+1), k++); k; \\ _Michel Marcus_, Dec 16 2023
%Y A368201 Cf. A016014, A024906.
%Y A368201 A070853 lists the corresponding primes.
%K A368201 nonn
%O A368201 1,1
%A A368201 _Robert Price_, Dec 16 2023