The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A193314 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A193314

The smallest k such that the product k*(k+1) is divisible by the first n primes and no others.
(history; published version)

#35 by Michel Marcus at Wed Jul 10 05:00:40 EDT 2024

STATUS

reviewed

approved

#34 by Joerg Arndt at Wed Jul 10 03:00:34 EDT 2024

STATUS

proposed

reviewed

#33 by Michel Marcus at Wed Jul 10 00:43:47 EDT 2024

STATUS

editing

proposed

#32 by Michel Marcus at Wed Jul 10 00:43:43 EDT 2024

LINKS

Carlos Rivera, The prime puzzles & problems connection, <a href="http://www.primepuzzles.net/puzzles/puzz_358.htm">Puzzle 358. Ruth-Aaron pairs revisited</a>, The Prime Puzzles & Problems Connection.

STATUS

proposed

editing

#31 by Jason Yuen at Tue Jul 09 21:27:41 EDT 2024

STATUS

editing

proposed

#30 by Jason Yuen at Tue Jul 09 21:27:37 EDT 2024

CROSSREFS

Cf. A002110, A002378, a006530, A006530, A118478.

STATUS

approved

editing

#29 by Joerg Arndt at Sat Nov 30 09:02:50 EST 2019

STATUS

reviewed

approved

#28 by Hugo Pfoertner at Sat Nov 30 07:19:30 EST 2019

STATUS

proposed

reviewed

Discussion

Sat Nov 30

07:30

David A. Corneth: We have gcd(k, k + 1) = 1 so we can check k with omega(k) <= 4 for n = 8 and prime factors from the first 8 primes. And then see if one of k-1 or k+1 is prime(8)-smooth up to some bound.

#27 by Giovanni Resta at Sat Nov 30 07:13:57 EST 2019

STATUS

editing

proposed

#26 by Giovanni Resta at Sat Nov 30 07:05:27 EST 2019

COMMENTS

If a term beyond a(8) exists, it is larger than 2.29*10^25. - Giovanni Resta, Nov 30 2019

STATUS

approved

editing