Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062568
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062568 Smallest n-digit strong pseudoprimes (in base 2). +0
6
2047, 15841, 104653, 1004653, 10323769, 100463443, 1002261781, 10000321321, 100004790097, 1000002977551, 10000130243671, 100002236680837, 1000003918690669 (list; graph; listen)
OFFSET

4,1

LINKS

Patrick De Geest, Smallest n-digit pseudoprimes(base 2)

EXAMPLE

a(1)=2047, So 2047 is the smallest strong pseudoprime of 4 digit length.

CROSSREFS

Cf. A001567, A068216, A067845, A001262, A062852.

Sequence in context: A038462 A001262 A141232 this_sequence A075954 A011561 A038998

Adjacent sequences: A062565 A062566 A062567 this_sequence A062569 A062570 A062571

KEYWORD

hard,more,nonn

AUTHOR

Shyam Sunder Gupta (guptass(AT)rediffmail.com), Feb 13 2002

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