A094378 Number of numbers having exactly n representations as ab+ac+bc with 0 < a < b < c.
65, 23, 91, 40, 197, 39, 195, 56, 298, 87, 217, 60, 512, 97, 327, 77, 562, 125, 433, 88, 712, 125, 484, 115, 924, 121
Offset: 0
Keywords
Examples
a(1) = 23 because there are 23 numbers (A093669) with unique representations.
References
- See A025052
Crossrefs
Programs
-
Mathematica
cntMax=10; nSol=Table[{0, 0, 0}, {cntMax+1}]; Do[lim=Ceiling[(n-2)/3]; cnt=0; Do[If[n>a*b && Mod[n-a*b, a+b]==0 && Quotient[n-a*b, a+b]>b, cnt++; If[cnt>cntMax, Break[]]], {a, 1, lim-1}, {b, a+1, lim}]; If[cnt<=cntMax, If[nSol[[cnt+1, 1]]==0, nSol[[cnt+1, 1]]=n]; nSol[[cnt+1, 2]]=n; nSol[[cnt+1, 3]]++;], {n, 10000}]; Table[nSol[[i, 3]], {i, cntMax+1}]
Comments