A091199 -id:A091199 - cp's OEIS frontend

A056900 Numbers n where 36n^2+36n+11 is prime.

0, 1, 2, 3, 5, 6, 7, 9, 13, 16, 17, 18, 19, 20, 24, 28, 36, 37, 39, 40, 41, 42, 45, 49, 50, 51, 53, 57, 58, 60, 61, 62, 64, 69, 70, 71, 73, 74, 75, 79, 83, 85, 91, 92, 93, 95, 100, 101, 108, 112, 113, 116, 118, 125, 129, 134, 136, 139, 144

Offset: 0

Henry Bottomley, Jul 05 2000

36m^2+36m+11=(6m+3)^2+2, i.e. two more than the square of odd multiples of 3. 36m^2+36m+11=72*(m*(m+1)/2)+11, i.e. eleven more than seventy-two times triangular numbers.

			a(3)=3 because 36*3^2+36*3+11=443 which is prime

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

This sequence (with the formula above) generates all except the first two terms of the sequence of primes of the form k^2+2, A056899.

Cf. A091199.

[n: n in [0..200]| IsPrime(36*n^2+36*n+11)]; // Vincenzo Librandi, Jul 14 2012

lst={};Do[If[PrimeQ[36*n^2+36*n+11],AppendTo[lst,n]],{n,0,100}];lst (* Vincenzo Librandi, Jul 14 2012 *)
Select[Range[0,200],PrimeQ[36#^2+36#+11]&] (* Harvey P. Dale, Sep 19 2020 *)

a(n) =A002024((A056899(n+2)-11)/72)

a(n) = A091199(n+1) - 1. - Jeppe Stig Nielsen, May 14 2017

A078728 a(n) is the smallest m such that m < 10^n, 10^n + m is prime and if the natural number k is such that 1 < k < 10 and 3 doesn't divide k10^n + m then k10^n+m is prime.

Original entry on oeis.org

3, 57, 297, 177, 237, 25111, 231339, 67419, 273817, 345111, 2001753, 912277, 5236153, 9228627, 10599391, 2835261, 60120003, 14054037, 27923629, 41783347, 24590943, 112161513, 230484021, 11446969, 205242589, 583389307, 873650007

Offset: 1

Farideh Firoozbakht, Dec 26 2003

nonn

a(n) is the smallest m such that m < 10^n and all six numbers 10^n + m, (Mod[m, 3]+2)*10^n + m, 4*10^n + m, (Mod[m, 3]+5)*10^n + m, 7*10^n + m & (Mod[m, 3]+8)*10^n + m are primes.

Carlos Rivera in Puzzle 245 of www.primepuzzles.net wrote "if the Faride's results ( a(n) for n=1,...,24 ) are plotted in Excel and a trend 'potential' function is asked, we obtain that a(n) is approximately equal to 0.5*n^6; this means that for n=999 a(n)=5*10^17, approximately." Since 10^n+a(n) is prime, for each n a(n)=0 (mod 3) or a(n)=1 (mod 3).

			a(6)=25111 because all the six numbers 1025111, 3025111, 4025111, 6025111, 7025111, 9025111 are primes and 25111 is the smallest number with this property.

Carlos Rivera, Puzzle 245. As 13

Cf. A003617, A033873.

Cf. A091199.

a[n_] := (For[m=1, !PrimeQ[10^n+2m-1]||!PrimeQ[(Mod[2m-1, 3]+2)10^n+2m-1]||! PrimeQ[4*10^n+2m-1]||!PrimeQ[(Mod[2m-1, 3]+5)10^n+2m-1]||!PrimeQ [7*10^n+2m-1]||!PrimeQ[(Mod[2m-1, 3]+8)10^n+2m-1], m++ ];2m-1); Do[Print[a[n]], {n, 32}]

a[n_] := (For[m=1, !PrimeQ[10^n+2m-1]||!PrimeQ[(Mod[2m-1, 3]+2)10^n+2m-1]||! PrimeQ[4*10^n+2m-1]||!PrimeQ[(Mod[2m-1, 3]+5)10^n+2m-1]||!PrimeQ [7*10^n+2m-1]||!PrimeQ[(Mod[2m-1, 3]+8)10^n+2m-1], m++ ];2m-1)

A334294 Numbers k such that 70k^2 + 70k - 1 is prime.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 17, 20, 22, 23, 24, 26, 27, 29, 30, 31, 33, 34, 36, 37, 39, 40, 41, 43, 44, 45, 46, 56, 57, 58, 59, 60, 61, 63, 64, 65, 66, 67, 68, 70, 71, 74, 76, 77, 78, 79, 80, 81, 82, 87, 88, 90, 93, 96, 97, 100

Offset: 1

James R. Buddenhagen, Apr 21 2020

nonn

Among quadratic polynomials in k of the form a*k^2 + a*k - 1 the value a=70 gives the most primes for any a in the range 1<=a<=300, at least up to k=40000. Here a and k are positive integers. Other "good" values of a are a=250, a=99, and a=19.

			For k=1, 70*k^2 + 70*k - 1 = 70*1^2 + 70*1 - 1 = 139, which is prime, so 1 is in the sequence.

N. Boston et M. L.Greenwood, Quadratics representing primes, Amer. Math. Monthly 102:7 (1995), 595-599.
François Dress and Michel Olivier, Polynômes prenant des valeurs premières, Experimental Mathematics, Volume 8, Issue 4 (1999), 319-338.
G. W. Fung and H. C. Williams, Quadratic polynomials which have a high density of prime values, Math. Comput. 55(191) (1990), 345-353.
R. A. Mollin, Prime-Producing Quadratics, The American Mathematical Monthly, Vol. 104, No. 6 (Jun. - Jul., 1997), pp. 529-544.

Cf. A001912, A002384, A005574, A027861, A028870, A056900.

Cf. A067201, A088572, A089623, A091199, A271980.

a:=proc(n) if isprime(70*n^2+70*n-1) then n else NULL end if end proc;
seq(a(n),n=1..100);

Select[Range@ 100, PrimeQ[70 #^2 + 70 # - 1] &] (* Michael De Vlieger, May 26 2020 *)

cp's OEIS Frontend

A056900 Numbers n where 36n^2+36n+11 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A078728 a(n) is the smallest m such that m < 10^n, 10^n + m is prime and if the natural number k is such that 1 < k < 10 and 3 doesn't divide k10^n + m then k10^n+m is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A334294 Numbers k such that 70k^2 + 70k - 1 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

cp's OEIS Frontend

A056900 Numbers n where 36n^2+36n+11 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A078728 a(n) is the smallest m such that m < 10^n, 10^n + m is prime and if the natural number k is such that 1 < k < 10 and 3 doesn't divide k*10^n + m then k*10^n+m is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A334294 Numbers k such that 70*k^2 + 70*k - 1 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A078728 a(n) is the smallest m such that m < 10^n, 10^n + m is prime and if the natural number k is such that 1 < k < 10 and 3 doesn't divide k10^n + m then k10^n+m is prime.

A334294 Numbers k such that 70k^2 + 70k - 1 is prime.