Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141768
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141768 Odd numbers with increasing numbers of bases to which they are strong pseudoprimes. +0
2
9, 25, 49, 91, 341, 481, 703, 1541, 1891, 2701, 5461, 6533, 8911, 12403, 18721, 29341, 31621, 38503, 79003, 88831 (list; graph; listen)
OFFSET

1,1

COMMENT

These numbers are the worst cases for the Rabin-Miller pseudoprimality test.

REFERENCES

Michael O. Rabin, "Probabilistic algorithm for testing primality", Journal of Number Theory 12:1 (1980), pp. 128-138.

LINKS

Charles R Greathouse IV, Home Page [in lieu of email address]

EXAMPLE

25 is a 7-, 18- and 24-strong pseudoprime and no odd number less than 25 has three or more bases to which it is a strong pseudoprime.

CROSSREFS

Cf. A014233.

Sequence in context: A016754 A110487 A030156 this_sequence A110284 A109367 A110588

Adjacent sequences: A141765 A141766 A141767 this_sequence A141769 A141770 A141771

KEYWORD

more,nonn

AUTHOR

Charles R Greathouse IV Sep 15 2008

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research