Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A094185
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A094185
Number of solutions to n == xy (mod z) == yz (mod x) == zx (mod y) with 0 < x < y < z.
+0
2
1, 6, 12, 24, 24, 49, 41, 59, 61, 100, 56, 132, 76, 127, 122, 165, 87, 223, 95, 207, 176, 190, 110, 318, 187, 232, 211, 342, 137, 440, 127, 327
(
list
;
graph
;
listen
)
page 1
Search completed in 0.001 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 17 23:40 EST 2009. Contains 171025 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
