Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075307
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075307 Smallest number m > 1 with m == k mod k-th prime for k = 1 to n. +0
1
3, 5, 23, 53, 1523, 29243, 299513, 4383593, 188677703, 5765999453, 5765999453, 2211931390883, 165468170356703, 8075975022064163, 361310530977154973, 20037783573808880093, 1779852341342071295513, 40235059344426324076913 (list; graph; listen)
OFFSET

1,1

COMMENT

Is a(n) == -1 mod 6 for n > 1? - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 17 2002

The answer is yes, since each term after the first must be 1 mod 2 and also 2 mod 3. Every such number is -1 mod 6. - Brian L. Galebach (sequence(AT)ProbabilitySports.com), Jun 02 2004

EXAMPLE

a(1) = 3 == 1 (mod 2), a(4) = 53 == 1 (mod 2) ==2 (mod 3) ==3 (mod 5) == 4 (mod 7)

PROGRAM

(PARI) a(n)=if(n<0, 0, s=1; while(sum(k=1, n, (s-k)%prime(k))>0, s++); s)

CROSSREFS

Identical to A053664 except for first term.

Sequence in context: A065720 A148554 A120937 this_sequence A100302 A023247 A027753

Adjacent sequences: A075304 A075305 A075306 this_sequence A075308 A075309 A075310

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 13 2002

EXTENSIONS

More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 17 2002

More terms from Brian L. Galebach (sequence(AT)ProbabilitySports.com), Jun 02 2004

More terms from Brian L. Galebach (sequence(AT)ProbabilitySports.com), Jun 14 2004

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research