Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083391
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083391 n-th Payam number E_{-}(n), defined as the smallest positive odd integer k such that for every positive integer n, the number k*2^n-1 is not divisible by any primes p such that the multiplicative order of 2 mod p is less than or equal to e. +0
2
3, 3, 45, 45, 45, 45, 45, 45, 2145, 2805, 92235, 92235, 92235, 92235, 92235, 92235, 529815, 529815, 529815, 529815, 529815, 529815, 529815, 529815, 1426425, 1426425, 247016055, 247016055, 247016055, 247016055 (list; graph; listen)
OFFSET

2,1

COMMENT

Payam numbers yield many primes of the form k*2^n+1 (Proth primes) and k*2^n-1.

LINKS

Robert Smith, A coordinated search for primes in the Payam number series.

Eric Weisstein's World of Mathematics, Payam Number

EXAMPLE

E_{-}(4) = 45 because 45 is the smallest odd integer k such that for every nonnegative integer n, k*2^n-1 is not divisible by 3, 5, or 7, the only primes p for which the multiplicative order of 2 mod p is less than or

equal to 4.

CROSSREFS

Cf. A083556.

Cf. A080076.

Sequence in context: A082394 A086889 A059495 this_sequence A009809 A100065 A066807

Adjacent sequences: A083388 A083389 A083390 this_sequence A083392 A083393 A083394

KEYWORD

nonn

AUTHOR

David Terr (davidcterr(AT)aol.com), Jun 11 2003

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research