Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064721
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A064721
%S A064721 383,766,881,1532,1643,1762,2897,3061,3064,3286,3443,3524,3829,4847,
%T A064721 4861,5297,5359,5794,5897,6122,6128,6319,6572,6886,7013,7352,7493,7651,
%U A064721 7658,7909,7957,8119,8269,8423,8543,8929,9323,9694,9722
%N A064721 Potential Sierpinski numbers: integers for which the smallest m > 2^10 
               in A040076 such that n*2^m+1 is prime (A050921).
%C A064721 The first confirmed Sierpinski number is 78557.
%t A064721 Do[m = 0; While[m <= 2^10 && !PrimeQ[n*2^m + 1], m++ ]; If[m > 2^10, 
               Print[n]], {n, 1, 10^4} ]
%Y A064721 Cf. A040076, A050921.
%Y A064721 Sequence in context: A015861 A072385 A045122 this_sequence A046014 A046491 
               A046492
%Y A064721 Adjacent sequences: A064718 A064719 A064720 this_sequence A064722 A064723 
               A064724
%K A064721 nonn
%O A064721 1,1
%A A064721 Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 16 2001

    
page 1

Search completed in 0.001 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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research