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.

A107994 Numbers n such that 11*n - 2 is prime.

This page as a plain text file.
%I A107994 #20 Sep 08 2022 08:45:19
%S A107994 3,5,9,15,21,23,29,35,41,59,63,69,75,83,89,93,99,101,105,119,125,131,
%T A107994 135,141,143,149,159,171,173,183,191,195,209,213,225,231,243,245,255,
%U A107994 269,273,275,279,281,293,303,315,321,329,339,345,353,359,365,369,371
%N A107994 Numbers n such that 11*n - 2 is prime.
%H A107994 Robert Israel, <a href="/A107994/b107994.txt">Table of n, a(n) for n = 1..10000</a>
%F A107994 a(n) = (A141856(n)+2)/11. - _Robert Israel_, Oct 04 2019
%e A107994 If n=3, then 11*n - 2 = 31 (prime).
%e A107994 If n=59, then 11*n - 2 = 647 (prime).
%p A107994 select(t -> isprime(11*t-2), [seq(i,i=1..1000,2)]); # _Robert Israel_, Oct 04 2019
%t A107994 Select[Range[500],PrimeQ[11#-2]&]  (* _Harvey P. Dale_, Mar 11 2011 *)
%o A107994 (Magma) [n: n in [1..100000] | IsPrime(11*n-2)] // _Vincenzo Librandi_, Nov 13 2010
%o A107994 (PARI) is(n)=isprime(11*n-2) \\ _Charles R Greathouse IV_, Jun 13 2017
%Y A107994 Cf. A141856.
%K A107994 nonn,easy
%O A107994 1,1
%A A107994 _Parthasarathy Nambi_, Jun 14 2005