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!)
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. 1
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; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
First, second and third component of the triples are resp. in A092817, A092818, A092819.
LINKS
EXAMPLE
The seventh triple is 184, 704, 776, hence a(7) = gcd(8*23,8*8*11,8*97) = 8.
PROG
(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
Sequence in context: A036114 A369230 A219909 * A183894 A151438 A355558
KEYWORD
nonn
AUTHOR
Klaus Brockhaus, Mar 07 2004
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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)