[go: up one dir, main page]

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

Revision History for A276969 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Odd integers n such that 2^n == 2^7 (mod n).
(history; published version)
#16 by Alois P. Heinz at Fri Oct 12 14:57:50 EDT 2018
STATUS

reviewed

approved

#15 by Wesley Ivan Hurt at Fri Oct 12 14:50:15 EDT 2018
STATUS

proposed

reviewed

#14 by Wesley Ivan Hurt at Fri Oct 12 14:50:07 EDT 2018
STATUS

editing

proposed

#13 by Wesley Ivan Hurt at Fri Oct 12 14:49:38 EDT 2018
CROSSREFS
STATUS

proposed

editing

#12 by Robert Price at Fri Oct 12 14:46:13 EDT 2018
STATUS

editing

proposed

#11 by Robert Price at Fri Oct 12 14:44:54 EDT 2018
MATHEMATICA

m = 2^7; Join[Select[Range[1, m, 2], Divisible[2^# - m, #] &],

Select[Range[m + 1, 10^3, 2], PowerMod[2, #, #] == m &]] (* Robert Price, Oct 12 2018 *)

STATUS

approved

editing

#10 by Bruno Berselli at Fri Sep 23 02:45:20 EDT 2016
STATUS

proposed

approved

#9 by Seiichi Manyama at Fri Sep 23 02:19:29 EDT 2016
STATUS

editing

proposed

#8 by Seiichi Manyama at Fri Sep 23 02:18:52 EDT 2016
LINKS

Seiichi Manyama, <a href="/A276969/b276969.txt">Table of n, a(n) for n = 1..10000</a>

STATUS

approved

editing

#7 by Charles R Greathouse IV at Thu Sep 22 23:19:22 EDT 2016
STATUS

editing

approved