LINKS
Amiram Eldar, <a href="/A087965/b087965_1.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..300 from Harvey P. Dale)
The OEIS is supported by the many generous donors to the OEIS Foundation.
Amiram Eldar, <a href="/A087965/b087965_1.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..300 from Harvey P. Dale)
reviewed
approved
proposed
reviewed
editing
proposed
Solutions to 2^x == 1 (mod x-1).
Solutions to Mod[ -1+2^x, x-1]=0.
(PARI) is(k) = !(k % 2) && Mod(2, k-1)^k == 1; \\ Amiram Eldar, Jul 10 2024
-1+Numbers k such that 2^n k - 1 is divisible by (nk-1).
Amiram Eldar, <a href="/A087965/b087965_1.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..300 from Harvey P. Dale)
Harvey P. Dale, Amiram Eldar, <a href="/A087965/b087965_1.txt">Table of n, a(n) for n = 1..30010000</a>
approved
editing
editing
approved
Harvey P. Dale, <a href="/A087965/b087965.txt">Table of n, a(n) for n = 1..300</a>
approved
editing
editing
approved