cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A067752 Number of unordered solutions of xy + xz + yz = n in nonnegative integers.

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 2, 3, 3, 2, 3, 4, 2, 3, 4, 4, 3, 3, 3, 5, 4, 2, 4, 6, 3, 4, 5, 4, 4, 4, 4, 6, 4, 3, 6, 7, 2, 4, 6, 6, 5, 4, 3, 7, 6, 3, 6, 8, 4, 5, 6, 5, 4, 6, 6, 9, 4, 2, 7, 8, 4, 5, 8, 7, 6, 6, 3, 8, 6, 4, 8, 9, 3, 6, 8, 7, 6, 4, 6, 11, 7, 3, 7, 10, 4, 6, 8, 6, 7
Offset: 1

Views

Author

Colin Mallows, Jan 31 2002

Keywords

Comments

An upper bound on the number of solutions appears to be 1.5*sqrt(n). - T. D. Noe, Jun 14 2006
a(n) is also the total number of distinct quadratic forms of discriminant -4n. A232551 counts only the primitive quadratic forms of discriminant -4n (those with all coefficients pairwise coprime) and A234287 includes those by which some prime can be represented (those with all coefficients pairwise coprime or coefficient of x^2 is prime or coefficient of y^2 is prime). This sequence includes all quadratic forms like 2x^2 + 2xy + 4y^2 and 2x^2 + 4y^2 which are non-primitive and those like 4x^2 + 2xy + 4y^2 and 4x^2 + 4xy + 4y^2 by which no prime can be represented (those with no restrictions). - V. Raman, Dec 24 2013

Examples

			a(12)=4 because of (0,1,12), (0,2,6), (0,3,4), (2,2,2).
a(20)=5 because of (0,1,20), (0,2,10), (0,4,5), (1,2,6), (2,2,4).
		

Crossrefs

Programs

  • Mathematica
    Table[cnt=0; Do[z=(n-x*y)/(x+y); If[IntegerQ[z], cnt++ ], {x,0,Sqrt[n/3]}, {y, Max[1,x],Sqrt[x^2+n]-x}]; cnt, {n,100}] (* T. D. Noe, Jun 14 2006 *)

Extensions

Corrected, extended and edited by John W. Layman, Dec 03 2004
Showing 1-1 of 1 results.