Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056600
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
5
5, 55, 1105, 32045 (list; graph; listen)
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: A130031 A119399 A102221 this_sequence A126456 A126157 A105715

Adjacent sequences: A056597 A056598 A056599 this_sequence A056601 A056602 A056603

KEYWORD

more,nonn

AUTHOR

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

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research