Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083556
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083556 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, 9, 15, 105, 105, 105, 105, 105, 165, 165, 75075, 75075, 75075, 75075, 75075, 75075, 855855, 855855, 5583435, 5583435, 5583435, 18625035, 18625035, 18625035, 18625035, 18625035, 27183585, 27183585, 27183585, 27183585, 27183585 (list; graph; listen)
OFFSET

2,1

COMMENT

Payam numbers are good candidates for looking for Proth primes, i.e. primes of the form k*2^n+1

LINKS

Author?, Title?

Eric Weisstein's World of Mathematics, Payam Number

EXAMPLE

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

CROSSREFS

Cf. A080076.

Cf. A083391.

Sequence in context: A110960 A050869 A038547 this_sequence A015664 A134137 A076362

Adjacent sequences: A083553 A083554 A083555 this_sequence A083557 A083558 A083559

KEYWORD

hard,nonn

AUTHOR

David Terr (davidcterr(AT)aol.com), Jun 10 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research