login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056600 a(n) is smallest number A such that there is an equality of the form (A=Product of n distinct primes) = (B=Product of n distinct primes) + (C=Product of n distinct primes) with GCD(A,B) = GCD(B,C) = GCD(A,C) = 1, B < C. 4
5, 55, 1105, 32045 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

5=2+3; 55=(5*11)=(2*17)+(3*7); 1105=(5*13*17)=(2*19*23)+(3*7*11); 32045=(5*13*17*29)=(2*11*23*31)+(3*7*19*41)

CROSSREFS

Cf. A056602, A069717, A069718.

Sequence in context: A158690 A192723 A102221 * A177819 A126456 A126157

Adjacent sequences:  A056597 A056598 A056599 * A056601 A056602 A056603

KEYWORD

more,nonn

AUTHOR

Naohiro Nomoto (6284968128(AT)geocities.co.jp), Aug 21 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:43 EST 2012. Contains 205978 sequences.