login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A220162 Smallest prime expressible as 2p + 3q (p, q primes) exactly in n ways. 1

%I #11 Jul 21 2018 03:20:15

%S 13,19,47,43,97,127,151,227,223,271,467,487,571,601,523,691,727,967,

%T 853,1151,1051,1213,1451,1303,1607,1579,1523,1867,1531,1951,1999,1987,

%U 2239,2647,2243,2663,2767,2683,3037,2917,3187,3259,3407,3673,3823,3797,4231

%N Smallest prime expressible as 2p + 3q (p, q primes) exactly in n ways.

%H Zak Seidov, <a href="/A220162/b220162.txt">Table of n, a(n) for n = 1..200</a>

%e 13 = 2*2 + 3*3,

%e 19 = 2*2 + 3*5 = 2*5 + 3*3,

%e 47 = 2*7 + 3*11 = 2*13 + 3*7 = 2*19 + 3*3.

%t mx = 50000; s = Table[0, {mx}]; Do[p = Prime[k]; Do[a = 2 Prime[i] + 3 p ; s[[a]]++, {i, PrimePi[(mx - 3 p)/2]}], {k, PrimePi[(mx - 4)/3]}];ta = Table[s[[Prime[k]]], {k, PrimePi[mx ]}]; Table[{k, Prime[Position[ta, k][[1, 1]]]}, {k, 200}] (* for b-file *)

%Y Cf. A079026, A219955, A219956, A219957, A219958, A219959.

%K nonn

%O 1,1

%A _Zak Seidov_, Dec 06 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)