The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A306826

a(0) = 1; a(n) is the smallest integer k > a(n-1) such that 2^(k-1) == 1 (mod a(n-1)*k).
(history; published version)

#22 by Vaclav Kotesovec at Sun Jun 06 07:59:27 EDT 2021

STATUS

reviewed

approved

#21 by Joerg Arndt at Sun Jun 06 06:40:29 EDT 2021

STATUS

proposed

reviewed

#20 by Michel Marcus at Sun Jun 06 06:05:36 EDT 2021

STATUS

editing

proposed

#19 by Michel Marcus at Sun Jun 06 06:05:32 EDT 2021

EXTENSIONS

More terms form _from _Amiram Eldar_, Mar 12 2019

STATUS

approved

editing

#18 by N. J. A. Sloane at Thu Apr 11 22:34:14 EDT 2019

STATUS

reviewed

approved

#17 by Wesley Ivan Hurt at Thu Apr 11 22:32:31 EDT 2019

STATUS

proposed

reviewed

#16 by Thomas Ordowski at Thu Apr 11 14:37:55 EDT 2019

STATUS

editing

proposed

#15 by Thomas Ordowski at Thu Apr 11 14:37:51 EDT 2019

COMMENTS

Conjecture: a(n) is prime for every n > 0, namely: a(n) is the smallest odd prime p > a(n-1) such that 2^(p-1) == 1 (mod a(n-1)), with a(0) = 1.

STATUS

proposed

editing

#14 by Thomas Ordowski at Thu Apr 11 14:37:13 EDT 2019

STATUS

editing

proposed

#13 by Thomas Ordowski at Thu Apr 11 14:37:02 EDT 2019

CROSSREFS

Cf. A175257, A307244.

STATUS

approved

editing