login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A297414
Numbers k such that 2^m == 2 (mod m*(m+1)), where m = A019320(k).
2
1, 4, 9, 12, 25, 36, 40, 52, 80, 92, 124, 150, 208, 306, 361, 630, 656, 1648, 1780, 2508, 3300, 3540, 5728, 6260, 6450, 7500, 10820, 12656, 14076, 14132, 18836, 20960, 23456, 24272, 35280, 43136
OFFSET
1,2
COMMENTS
Also, numbers k such that A019320(k) belongs to A216822.
PROG
(PARI) is_A297414(k) = my(m=polcyclo(k, 2)); Mod(2, m*(m+1))^m==2;
CROSSREFS
KEYWORD
nonn
AUTHOR
Max Alekseyev, Dec 29 2017
STATUS
approved