The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067751 Number of solutions in nonnegative integers of xy+xz+yz=n. 3
 3, 6, 7, 9, 9, 12, 9, 15, 12, 12, 15, 19, 9, 18, 18, 18, 15, 18, 15, 27, 18, 12, 21, 30, 12, 24, 22, 21, 21, 24, 21, 30, 18, 18, 30, 36, 9, 24, 30, 30, 27, 24, 15, 39, 27, 18, 33, 37, 18, 30, 30, 27, 21, 36, 30, 48, 18, 12, 39, 42, 21, 30, 39, 33, 30, 36, 15, 45, 30, 24, 45, 45, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS An upper bound on the number of solutions appears to be 9*sqrt(n). - T. D. Noe, Jun 14 2006 LINKS T. D. Noe, Table of n, a(n) for n = 1..10000 EXAMPLE a(3)=7 because of (0,1,3),(0,3,1),(1,0,3),(1,3,0),(3,0,1),(3,1,0),(1,1,1). MATHEMATICA CntFunc[s_List] := Module[{len=Length[Union[s]]}, If[len==3, 6, If[len==2, 3, 1]]]; Table[cnt=0; Do[z=(n-x*y)/(x+y); If[IntegerQ[z], cnt=cnt+CntFunc[{x, y, z}]], {x, 0, Sqrt[n/3]}, {y, Max[1, x], Sqrt[x^2+n]-x}]; cnt, {n, 100}] - T. D. Noe, Jun 14 2006 CROSSREFS Cf. A067752, A067753, A067754. Sequence in context: A181919 A021735 A121550 * A283762 A088045 A267983 Adjacent sequences:  A067748 A067749 A067750 * A067752 A067753 A067754 KEYWORD easy,nonn AUTHOR Colin Mallows, Jan 31 2002 EXTENSIONS Corrected and extended by T. D. Noe, Jun 14 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 03:22 EST 2020. Contains 338865 sequences. (Running on oeis4.)