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.

A102731 Numbers k such that 11*k + 23 is prime.

This page as a plain text file.
%I A102731 #20 May 31 2025 15:06:30
%S A102731 0,4,6,16,28,30,34,36,40,54,58,60,64,76,78,84,88,90,100,114,118,126,
%T A102731 130,144,160,168,180,186,190,196,204,208,210,214,216,228,240,244,246,
%U A102731 258,264,268,274,286,288,294,298,300,306,310,316,328,334,336,348,354,364
%N A102731 Numbers k such that 11*k + 23 is prime.
%H A102731 Harvey P. Dale, <a href="/A102731/b102731.txt">Table of n, a(n) for n = 1..1000</a>
%F A102731 a(n) = A102656(n) - 2. - _R. J. Mathar_, Jul 08 2009
%e A102731 If k=0, then 11*0 + 23 = 23 (prime).
%e A102731 If k=54, then 11*54 + 23 = 617 (prime).
%e A102731 If k=114, then 11*114 + 23 = 1277 (prime).
%t A102731 Select[Range[0,400],PrimeQ[11#+23]&] (* _Harvey P. Dale_, Oct 17 2011 *)
%o A102731 (Magma) [n: n in [0..1000] | IsPrime(11*n + 23)]; // _Vincenzo Librandi_, Nov 17 2010
%o A102731 (PARI) is(n)=isprime(11*n+23) \\ _Charles R Greathouse IV_, Jun 12 2017
%K A102731 nonn,easy
%O A102731 1,2
%A A102731 _Parthasarathy Nambi_, Feb 07 2005