login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131459 Residues of 3^(2^(p(n)-1)) for Mersenne numbers with prime indices. 6
0, 4, 28, 124, 601, 8188, 131068, 524284, 5758678, 269332797, 2147483644, 60499757946, 322343434415, 5567835897839, 16557488261208, 7853427629182494, 426047939903614778, 2305843009213693948, 141920345591572240917 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Mp is prime iff 3^(2^(p(n)-1)) is congruent to (-3) Mod Mp. Thus M7 = 127 is prime because 3^64 Mod 127 = 124 (=127-3) while M11 = 2047 is composite because 3^1024 Mod 2047 <> 2044.
LINKS
FORMULA
a(n) = 3^(2^(p(n)-1)) Mod 2^p(n)-1
EXAMPLE
a(5) = 3^(2^(11-1)) Mod 2^11-1 = 3^1024 Mod 2047 = 601
CROSSREFS
Sequence in context: A212900 A196514 A249629 * A231581 A223115 A296381
KEYWORD
nonn
AUTHOR
Dennis Martin (dennis.martin(AT)dptechnology.com), Jul 13 2007, Jul 20 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 21 15:15 EDT 2024. Contains 375353 sequences. (Running on oeis4.)