Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050921
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A050921
%S A050921 2,3,7,5,11,7,29,17,19,11,23,13,53,29,31,17,137,19,1217,41,43,23,
%T A050921 47,97,101,53,109,29,59,31,7937,257,67,137,71,37,149,1217,79,41,
%U A050921 83,43,173,89,181,47
%N A050921 Smallest prime of form n*2^m+1, m >= 0, or 0 if no prime exists.
%C A050921 Primes arising from A040076 (or 0 if no such prime exists).
%t A050921 Do[m = 0; While[ !PrimeQ[n*2^m + 1], m++ ]; Print[n*2^m + 1], {n, 1, 
               47} ]
%Y A050921 Cf. A040076, A034694, A038699.
%Y A050921 Sequence in context: A087572 A085107 A034694 this_sequence A087386 A110359 
               A092977
%Y A050921 Adjacent sequences: A050918 A050919 A050920 this_sequence A050922 A050923 
               A050924
%K A050921 nonn,easy,nice
%O A050921 1,1
%A A050921 N. J. A. Sloane (njas(AT)research.att.com), Dec 30 1999
%E A050921 The next term (47*2^583 + 1) is too large to show.

    
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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research