login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A290870 a(n) is the number of ways to represent n as n = x*y + y*z + z*x where 0 < x < y < z. 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 2, 0, 0, 2, 1, 0, 2, 0, 2, 1, 0, 1, 2, 1, 0, 2, 2, 0, 3, 0, 1, 3, 0, 1, 4, 0, 1, 2, 2, 1, 2, 2, 2, 3, 0, 0, 5, 0, 2, 3, 2, 1, 2, 2, 1, 4, 2, 0, 6, 0, 1, 4, 2, 3, 2, 0, 4, 3, 2, 1, 5, 2, 0, 4, 4, 0, 5, 2, 2, 4, 0, 3, 6, 2, 1, 3, 3, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,23
COMMENTS
a(n) = 0 if and only if n is a term of A000926.
a(n) = 1 if and only if n is a term of A093669.
LINKS
FORMULA
For the triples (x,y,z) we have x < sqrt(n / 3), y < (n - x^2) / (2 * x), z = (n - x*y) / (x + y) which must be integer. - David A. Corneth, Oct 01 2017
EXAMPLE
For (x, y, z) = (1, 3, 5), we have x * y + y * z + z * x = 1 * 3 + 3 * 5 + 5 * 1 = 23 and similarily for (x, y, z) = (1, 2, 7), we have x * y + y * z + z * x = 23. Those 2 triples are all for n=23, so a(23) = 2. - David A. Corneth, Oct 01 2017
PROG
(PARI) N=10^3; V=vector(N);
{ for (x=1, N,
for (y=x+1, N, t=x*y; if( t > N, break() );
for (z=y+1, N,
tt = t + y*z + z*x; if( tt > N, break() );
V[tt]+=1;
); ); ); }
V \\ Joerg Arndt, Oct 01 2017
(PARI) a(n) = {my(res = 0);
for(x = 1, sqrtint(n\3), for(y = x + 1, (n - x^2) \ (2 * x), z = (n - x*y) / (x + y); if(z > y && z == z\1, res++))); res} \\ David A. Corneth, Oct 01 2017
CROSSREFS
Cf. A066955 (ways to represent n as n = x*y + y*z + z*x where 0 <= x <= y <= z).
Cf. A094377 (greatest number having exactly n representations).
Cf. A094376 (indices of records).
Sequence in context: A238304 A219487 A303907 * A353501 A353428 A244738
KEYWORD
nonn
AUTHOR
Joerg Arndt, Aug 13 2017
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 05:47 EDT 2024. Contains 373661 sequences. (Running on oeis4.)