|
|
A165141
|
|
The least positive integer that can be written in exactly n ways as the sum of a square, a pentagonal number and a hexagonal number
|
|
1
|
|
|
3, 9, 1, 6, 16, 36, 50, 37, 66, 82, 167, 121, 162, 236, 226, 276, 302, 446, 478, 532, 457, 586, 677, 521, 666, 852, 976, 877, 1006, 1046, 1277, 1381, 1857, 1556, 1507, 1657, 1832, 1732, 2336, 2299, 2007, 2677, 2326, 2117, 2591, 2502, 2516, 2592, 3106, 3557
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
On Sep 04 2009, Zhi-Wei Sun conjectured that the sequence A160324 contains every positive integer, i.e., for each positive integer n there exists a positive integer s which can be written in exactly n ways as the sum of a square, a pentagonal number and a hexagonal number. Based on this conjecture we create the current sequence. It seems that 0.9 < a(n)/n^2 < 1.6 for n > 33. Zhi-Wei Sun conjectured that a(n)/n^2 has a limit c with 1.1 < c < 1.2. On Sun's request, his friend Qing-Hu Hou produced a list of a(n) for n = 1..913 (see the b-file).
|
|
LINKS
|
|
|
FORMULA
|
a(n) = min{m>0: m=x^2+(3y^2-y)/2+(2z^2-z) has exactly n solutions with x,y,z=0,1,2,...}.
|
|
EXAMPLE
|
For n=5 the a(5)=16 solutions are 0^2+1+15 = 1^2+0+15 = 2^2+12+0 = 3^2+1+6 = 4^2+0+0 = 16.
|
|
MATHEMATICA
|
SQ[x_]:=x>-1&&IntegerPart[Sqrt[x]]^2==x RN[n_]:=Sum[If[SQ[n-(3y^2-y)/2-(2z^2-z)], 1, 0], {y, 0, Sqrt[n]}, {z, 0, Sqrt[Max[0, n-(3y^2-y)/2]]}] Do[Do[If[RN[m]==n, Print[n, " ", m]; Goto[aa]], {m, 1, 1000000}]; Label[aa]; Continue, {n, 1, 100}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|