Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083732
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083732 Pseudoprimes to bases 2 and 5. +0
1
561, 1729, 2821, 5461, 6601, 8911, 12801, 13981, 15841, 29341, 41041, 46657, 52633, 63973, 68101, 75361, 101101, 113201, 115921, 126217, 137149, 162401, 172081, 188461, 252601, 294409, 314821, 334153, 340561, 399001, 401401, 410041, 488881 (list; graph; listen)
OFFSET

1,1

LINKS

F. Richman, Primality testing with Fermat's little theorem

FORMULA

a(n) = n-th positive integer k(>1) such that 2^(k-1) = 1 (mod k) and 5^(k-1) = 1 (mod k)

EXAMPLE

a(1)=561 since 561 is the first positive integer k(>1) which satisfies 2^(k-1) = 1 (mod k) and 5^(k-1) = 1 (mod k)

PROGRAM

Assembly

CROSSREFS

Sequence in context: A083733 A048123 A131672 this_sequence A135720 A097130 A110889

Adjacent sequences: A083729 A083730 A083731 this_sequence A083733 A083734 A083735

KEYWORD

easy,nonn

AUTHOR

Serhat Sevki Dincer (sevki(AT)ug.bilkent.edu.tr), May 05 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