Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122094
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122094 Prime divisors of Mersenne numbers. Primes p such that the multiplicative order of 2 modulo p is prime. +0
2
3, 7, 23, 31, 47, 89, 127, 167, 223, 233, 263, 359, 383, 431, 439, 479, 503, 719, 839, 863, 887, 983, 1103, 1319, 1367, 1399, 1433, 1439, 1487, 1823, 1913, 2039, 2063, 2089, 2207, 2351, 2383, 2447, 2687, 2767, 2879, 2903, 2999, 3023, 3119, 3167, 3343 (list; graph; listen)
OFFSET

1,1

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

FORMULA

p is a prime divisor of a Mersenne number 2^q - 1 iff prime q is the multiplicative order of 2 modulo p.

PROGRAM

(PARI) forprime(p=3, 10^5, if(isprime(znorder(Mod(2, p))), print1(p, ", ")))

CROSSREFS

Cf. A001348, A016047, A003260, A000668.

Sequence in context: A087309 A127781 A165580 this_sequence A135570 A053027 A133432

Adjacent sequences: A122091 A122092 A122093 this_sequence A122095 A122096 A122097

KEYWORD

nonn

AUTHOR

Max Alekseyev (maxale(AT)gmail.com), Oct 25 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research