Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062852
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062852 Largest n-digit strong pseudoprimes (in base 2). +0
6
8321, 90751, 983401, 9995671, 99789673, 999828727, 9998721001, 99973476433, 999855751441, 9998974546471, 99999760517281, 999985147456681 (list; graph; listen)
OFFSET

4,1

LINKS

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

EXAMPLE

a(1)=8321 since 8321 is the largest strong pseudoprime (base 2) of 4 digit length.

CROSSREFS

Cf. A001567, A068216, A067845, A001262, A062568.

Sequence in context: A031679 A031589 A031769 this_sequence A124414 A124415 A031947

Adjacent sequences: A062849 A062850 A062851 this_sequence A062853 A062854 A062855

KEYWORD

hard,more,nonn,base

AUTHOR

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

EXTENSIONS

Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Nov 01 2009

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research