Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066851
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066851 Number of ordered solutions (x,y,z) to xy + yz + zx = n with x,y,z >= 1. +0
2
0, 0, 1, 0, 3, 0, 3, 3, 3, 0, 9, 1, 3, 6, 6, 3, 9, 0, 9, 9, 6, 0, 15, 6, 3, 12, 10, 3, 15, 0, 15, 12, 6, 6, 18, 9, 3, 12, 18, 6, 21, 0, 9, 21, 9, 6, 27, 7, 9, 12, 18, 9, 15, 12, 18, 24, 6, 0, 33, 6, 15, 18, 21, 12, 18, 12, 9, 27, 18, 0, 39, 9, 9, 24, 19, 21, 18, 0, 27, 27, 18, 6, 33, 18, 6 (list; graph; listen)
OFFSET

1,5

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

EXAMPLE

a(5) = 3 since there are solutions (2,1,1), (1,2,1), (1,1,2).

CROSSREFS

a(A025052(n))=0. Cf. A066958.

Sequence in context: A097994 A053604 A066958 this_sequence A167223 A078907 A111815

Adjacent sequences: A066848 A066849 A066850 this_sequence A066852 A066853 A066854

KEYWORD

easy,nonn

AUTHOR

Colin Mallows, Jan 24 2002

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 25 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research