|
Search: id:A092864
|
|
|
| A092864 |
|
Greatest common divisor of triples a,b,c such that a < b < c, (a*b) mod (a+b) = c, (b*c) mod (b+c) = a, (c*a) mod (c+a) = b. The triples are ordered according to sum of first and second component. |
|
+0
2
|
|
| 1, 3, 3, 25, 5, 105, 8, 23, 25, 108, 96, 69, 204, 91, 19, 83, 145, 26, 225, 61, 77, 37, 107, 51, 9, 97, 133, 101, 49, 92, 23, 296, 67, 64, 345, 29, 161, 240, 109, 128, 27, 280, 107, 289, 53, 56, 151, 465, 235, 315, 91, 71, 43, 99, 72, 200, 26, 130, 49, 438, 57, 31, 227
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
First, second and third component of the triples are resp. in A092817, A092818, A092819.
|
|
EXAMPLE
|
The seventh triple is 184, 704, 776, hence a(7) = gcd(8*23,8*8*11,8*97) = 8.
|
|
PROGRAM
|
(PARI) {m=4600; for(n=3, m, for(a=1, (n-1)\2, b=n-a; c=a*b%(a+b); if(b<c, if((b*c)%(b+c)==a, if((a*c)%(a+c)==b, print1(gcd(gcd(a, b), c), ", ")))))); }
|
|
CROSSREFS
|
Cf. A091509, A092817, A092818, A092819.
Sequence in context: A159910 A130723 A036114 this_sequence A151438 A157036 A080302
Adjacent sequences: A092861 A092862 A092863 this_sequence A092865 A092866 A092867
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Mar 07 2004
|
|
|
Search completed in 0.002 seconds
|
