The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A350655 a(n) is the least positive number that can be written as p^2 + p*q + q^2 in exactly n ways where p and q are primes and p <= q. 0
1, 12, 147, 57603, 160797, 4611243, 36822513, 878112417, 2069618187, 9891199227, 9098192883, 27885254943, 73104587283, 132014176203, 3457814397303, 1449081095007, 5644476547437, 9051074413563, 31516441411377, 8343886414773, 5272121828883 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
a(9) > 5*10^9. - Jon E. Schoenfield, Jan 13 2022
LINKS
EXAMPLE
a(3) = 57603 as 57603 has the three representations 57603 = 2^2 + 2*239 + 239^2 = 31^2 + 31*223 + 223^2 = 101^2 + 101*173 + 173^2 and no smaller number has this property.
MAPLE
N:= 10^9:
Q:= Vector(N, datatype=integer[4]):
P:= select(isprime, [2, seq(i, i=3..floor(sqrt(N)), 2)]):
T:= Array(0..7): T[0]:= 1:
nP:= nops(P):
for i from 1 to nP do
for j from 1 to i do
v:= P[i]^2 + P[i]*P[j] + P[j]^2;
if v > N then break fi;
Q[v]:= Q[v]+1;
if T[Q[v]] = 0 or v < T[Q[v]] then T[Q[v]]:= v fi
od od:
convert(T, list);
CROSSREFS
Cf. A349987.
Sequence in context: A039493 A196454 A329013 * A167138 A001406 A057572
KEYWORD
nonn,more
AUTHOR
J. M. Bergot and Robert Israel, Jan 09 2022
EXTENSIONS
a(8) from Jon E. Schoenfield, Jan 13 2022
a(9)-a(20) from Martin Ehrenstein, Jan 24 2022
STATUS
approved

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 May 20 05:07 EDT 2024. Contains 372703 sequences. (Running on oeis4.)