Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020498
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A020498
%S A020498 1,3,7,9,13,19,21,27,31,33,37,43,49,51,57,63,69,73,79,87,91,97,99,103,
%T A020498 111,117,121,129,133,139,141,147,153,157,159,163,169,177,183,187,189,
%U A020498 199,201,211,213,217,231,241,243,247,253,261,267,271,273,279,283,289
%N A020498 a(n) is the smallest number such that n primes occur infinitely often 
               among (x+a(1), ...,x+a(n)).
%C A020498 a(n) is the least number > a(n-1) such that a(1) through a(n) do not 
               contain all residues modulo any prime. - David Wasserman (wasserma(AT)spawar.navy.mil), 
               Aug 17 2005
%D A020498 R. K. Guy's "Unsolved Problems in Number Theory" (2nd edition, Springer, 
               1994), Section A9.
%Y A020498 Cf. A020497.
%Y A020498 Sequence in context: A066207 A141544 A088649 this_sequence A107771 A103601 
               A111250
%Y A020498 Adjacent sequences: A020495 A020496 A020497 this_sequence A020499 A020500 
               A020501
%K A020498 nonn
%O A020498 1,2
%A A020498 Robert G. Wilson v (rgwv(AT)rgwv.com) and Chris Thompson (cet1(AT)cus.cam.ac.uk)
%E A020498 More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Aug 17 
               2005

    
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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research