Search: id:A094376
Results 1-1 of 1 results found.

%I A094376
%S A094376 1,11,23,41,47,59,71,116,119,131,164,425,191,236,239,446,335,419,311,
%T A094376 404,431,584,647,524,479,1019,831,776,671,944,719,1076,839,1004,959,
%U A094376 1889,1196,2099,1271,1856,1151,1931,1391,1676,1319,1616,1751,3275,1511
%N A094376 Least number having exactly n representations as ab+ac+bc with 0 < a 
               < b < c.
%C A094376 Note that the Mathematica program computes A094376, A094377 and A094378, 
               but outputs only this sequence.
%D A094376 See A025052
%e A094376 a(2) = 23 because 23 is the least number with 2 representations: (a,b,
               c) = (1,2,7) and (1,3,5).
%t A094376 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, 1]], {i, 
               cntMax+1}]
%Y A094376 Cf. A000926 (n having no representations), A093669 (n having one representation), 
               A094377, A094378.
%Y A094376 Sequence in context: A019356 A046440 A119890 this_sequence A086524 A060915 
               A052034
%Y A094376 Adjacent sequences: A094373 A094374 A094375 this_sequence A094377 A094378 
               A094379
%K A094376 nonn
%O A094376 0,2
%A A094376 T. D. Noe (noe(AT)sspectra.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), 
               Apr 28 2004

Search completed in 0.001 seconds