OFFSET
1,1
COMMENTS
Conjecture: a(n) exists for any n > 0. Moreover, no term a(n) is divisible by 5.
It seems that no term a(n) is congruent to 8 modulo 10.
LINKS
Zhi-Wei Sun, Table of n, a(n) for n = 1..160
Zhi-Wei Sun, On universal sums of polygonal numbers, arXiv:0905.0635 [math.NT], 2009-2015.
EXAMPLE
a(3) = 6 since 6 is the least positive integer m with A254631(m) = 3. Note that 6 = 0*1/2 + 1*(3*1+2) + 1*(3*1-2) = 1*2/2 + 1*(3*1+2) + 0*(3*0-2) = 3*4/2 + 0*(3*0+2) + 0*(3*0-2).
MATHEMATICA
TQ[n_]:=IntegerQ[Sqrt[8n+1]]
Do[Do[m=0; Label[aa]; m=m+1; r=0; Do[If[TQ[m-y(3y+2)-z(3z-2)], r=r+1; If[r>n, Goto[aa]]], {y, 0, (Sqrt[3m+1]-1)/3}, {z, 0, (Sqrt[3(m-y(3y+2))+1]+1)/3}];
If[r==n, Print[n, " ", m]; Goto[bb], Goto[aa]]]; Label[bb]; Continue, {n, 1, 50}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Feb 04 2015
STATUS
approved