Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092889
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
5
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; listen)
OFFSET

1,1

COMMENT

Suggested by Thomas A. Nagy. - A092887 gives first component, A092888 gives second component, A092890 gives fourth component.

EXAMPLE

The fourth quadruple is 56, 63, 88, 171, hence a(4) = 88.

PROGRAM

(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<d, if(a*b*d%(a+b+d)==c, if(a*c*d%(a+c+d)==b, if(b*c*d%(b+c+d)==a, print1(c, ", "))))))))}

CROSSREFS

Cf. A092887, A092888, A092890, A092891.

Sequence in context: A023695 A038466 A063310 this_sequence A033832 A043219 A039396

Adjacent sequences: A092886 A092887 A092888 this_sequence A092890 A092891 A092892

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Mar 12 2004

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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research