The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A131461 Residues of 3^(2^p(n)-2) for Mersenne numbers with prime indices. 6
0, 1, 1, 1, 1013, 1, 1, 1, 5884965, 65165529, 1, 103888408793, 474639880182, 4112907695371, 72685811469476, 5155089749987738, 440411515280180314, 1, 95591506202441271281, 69291880649932219827 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
M_p is prime iff 3^(M_p-1) is congruent to 1 mod M_p. Thus M_7 = 127 is prime because 3^126 mod 127 = 1 while M_11 = 2047 is composite because 3^2046 mod 2047 <> 1.
LINKS
FORMULA
a(n) = 3^(2^p(n)-2) mod 2^p(n)-1
EXAMPLE
a(5) = 3^(2^11-2) mod 2^11-1 = 3^2046 mod 2047 = 1013
CROSSREFS
Sequence in context: A022054 A107518 A073144 * A166975 A266369 A165295
KEYWORD
nonn
AUTHOR
Dennis Martin (dennis.martin(AT)dptechnology.com), 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 May 15 14:34 EDT 2024. Contains 372540 sequences. (Running on oeis4.)