|
Search: id:A094358
|
|
|
| A094358 |
|
Numbers n such that 2^^n == 1 mod n, where 2^^x is A014221(x). |
|
+0
2
|
|
| 1, 3, 5, 15, 17, 51, 85, 255, 257, 641, 771, 1285, 1923, 3205, 3855, 4369, 9615, 10897, 13107, 21845, 32691, 54485, 65535, 65537, 114689, 163455, 164737, 196611, 274177, 319489, 327685, 344067, 494211, 573445, 822531, 823685, 958467, 974849, 983055
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
641 is first member not in sequences A001317, A004729, etc. Conjecture: the sequence consists of all squarefree products of factors of Fermat numbers (A023394).
|
|
LINKS
|
Robert G. Wilson v, Table of n, a(n) for n = 1..55
Robert Munafo, Sequence A094358, 2^^A(N) = 1 mod N
|
|
EXAMPLE
|
3 is a member because 2^^3 = 16, and 16 == 1 mod 3. 15 is a member because 2^^15 == 1 mod 15. 2^^x is A014221(x).
|
|
CROSSREFS
|
Cf. A023394, A014221, A092188, A001317, A004729.
Sequence in context: A097856 A071593 A018358 this_sequence A003527 A004729 A045544
Adjacent sequences: A094355 A094356 A094357 this_sequence A094359 A094360 A094361
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert Munafo (mrob(AT)mrob.com), Apr 26 2004
|
|
|
Search completed in 0.002 seconds
|
