|
Search: id:A072982
|
|
|
| A072982 |
|
Primes p for which the period length of 1/p is a power of 2. |
|
+0
2
|
|
| 3, 11, 17, 73, 101, 137, 257, 353, 449, 641, 1409, 10753, 15361, 19841, 65537, 69857, 453377, 976193, 1514497, 5767169, 5882353, 6187457, 8253953, 8257537, 70254593, 167772161, 175636481, 302078977, 458924033, 639631361, 1265011073
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
15361 has a period length of 256 = 2^8, hence 15361 is in the sequence.
All Fermat primes>5 (A019434) are in the sequence, since it can be shown that the period length of 1/(2^(2^n)+1) is 2^(2^n) whenever 2^(2^n)+1 is prime. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 13 2007
|
|
LINKS
|
Ray Chandler, Table of n, a(n) for n = 1..36.
Index entries for sequences related to decimal expansion of 1/n
|
|
MATHEMATICA
|
Do[ If[ IntegerQ[ Log[2, Length[ RealDigits[ 1/Prime[n]] [[1, 1]]]]], Print[ Prime[n]]], {n, 1, 47500}] (*Robert G. Wilson v*)
pmax = 10^10; p = 1; While[p < pmax, p = NextPrime[p]; If[ IntegerQ[Log[2, MultiplicativeOrder[10, p] ] ], Print[ p]; ]; ]; (*Chandler*)
|
|
PROGRAM
|
(PARI) ? a(n)=if(n<4, n==2, znorder(Mod(10, prime(n)))) ? for(n=1, 20000, if(gcd(a(n), 2^1000)==a(n), print1(prime(n), ", ")))
|
|
CROSSREFS
|
Cf. A002371, A007138, A054471.
Sequence in context: A032008 A061368 A145701 this_sequence A124787 A080306 A036448
Adjacent sequences: A072979 A072980 A072981 this_sequence A072983 A072984 A072985
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 26 2002
|
|
EXTENSIONS
|
Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 20 2002
a(18) from Ray Chandler (rayjchandler(AT)sbcglobal.net), May 02 2007
a(19) from Robert G. Wilson v (rgwv(AT)rgwv.com), May 09 2007
a(20)-a(32) from Ray Chandler (rayjchandler(AT)sbcglobal.net), May 14 2007
|
|
|
Search completed in 0.002 seconds
|
