Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105222
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105222 Minimal base a>1 to which n is Fermat pseudoprime, i.e. a^(n-1)=1 (mod n). +0
1
3, 2, 5, 2, 7, 2, 9, 8, 11, 2, 13, 2, 15, 4, 17, 2, 19, 2, 21, 8, 23, 2, 25, 7, 27, 26, 9, 2, 31, 2, 33, 10, 35, 6, 37, 2, 39, 14, 41, 2, 43, 2, 45, 8, 47, 2, 49, 18, 51, 16, 9, 2, 55, 21, 57, 20, 59, 2, 61, 2, 63, 8, 65, 8, 25, 2, 69, 22, 11, 2, 73, 2, 75, 26, 45, 34, 79, 2, 81, 80, 83, 2 (list; graph; listen)
OFFSET

2,1

LINKS

Eric Weisstein's World of Mathematics, Fermat Pseudoprime

FORMULA

a(2k)=2k+1, a(p)=2 for prime p.

CROSSREFS

Adjacent sequences: A105219 A105220 A105221 this_sequence A105223 A105224 A105225

Sequence in context: A023513 A069735 A046524 this_sequence A086571 A133945 A124219

KEYWORD

easy,nonn

AUTHOR

Max Alekseyev (maxal(AT)cs.ucsd.edu), Apr 14 2005

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 October 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research