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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092889 Third component of quadruples a,b,c,d such that a < b < c < d, (a*b*c) mod (a+b+c) = d, (a*b*d) mod (a+b+d) = c, (a*c*d) mod (a+c+d) = b, (b*c*d) mod (b+c+d) = a. The quadruples are ordered according to sum of first three components, secondary by first component, thirdly by second component. 4
 40, 97, 128, 88, 96, 142, 151, 164, 238, 237, 189, 184, 174, 212, 304, 295, 268, 256, 350, 279, 350, 320, 374, 308, 443, 328, 475, 329, 290, 394, 416, 367, 470, 686, 517, 438, 585, 605, 640, 620, 572, 498, 736, 455, 435, 650, 502, 635, 625, 605, 846, 891 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Suggested by Thomas A. Nagy. - A092887 gives first component, A092888 gives second component, A092890 gives fourth component. LINKS EXAMPLE The fourth quadruple is 56, 63, 88, 171, hence a(4) = 88. PROG (PARI) {m=1110; for(n=6, m, for(a=1, (n-3)\3, for(b=a+1, (n-a-1)\2, c=n-a-b; d=a*b*c%(a+b+c); if(c

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.

Last modified November 27 12:40 EST 2022. Contains 358405 sequences. (Running on oeis4.)