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!)
A227654 Ruth-Aaron triples (1): sum of primes dividing n = sum of primes dividing (n+1) = sum of primes dividing (n+2). 0

%I #8 Jul 19 2020 04:04:21

%S 89460294,151165960539,3089285427491,6999761340223,7539504384825

%N Ruth-Aaron triples (1): sum of primes dividing n = sum of primes dividing (n+1) = sum of primes dividing (n+2).

%C a(6) > 10^13. Taking into account primes multiplicity (A039752), the only triples up to 10^13 are those starting at 417162 and 6913943284.

%H Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_358.htm">Puzzle 358. Ruth-Aaron Pairs Revisited</a>, The Prime Puzzles and Problems Connection.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Ruth-AaronPair.html">Ruth-Aaron Pair</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Ruth-Aaron_pair">Ruth-Aaron pair</a>

%e 7539504384825 = 3^2 * 5^2 * 7^2 * 43 * 251 * 63361,

%e 7539504384826 = 2 * 19 * 367 * 10181 * 53101,

%e 7539504384827 = 17 * 457 * 26309 * 36887 and

%e 3 + 5 + 7 + 43 + 251 + 63361 = 2 + 19 + 367 + 10181 + 53101 = 17 + 457 + 26309 + 36887.

%Y Cf. A006145, A039752.

%K nonn

%O 1,1

%A _Giovanni Resta_, Jul 19 2013

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.)