Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116151
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116151 a(n) = smallest positive integer x satisfying the system of congruences x == 1 (mod 2), x == 2 (mod 3), x == 3 (mod 5), x == 5 (mod 7), ..., x == p[n-1] (mod p[n]), where p[n] is the n-th prime number and p[0] taken to be 1. +0
2
1, 5, 23, 173, 2273, 2273, 452723, 6578843, 113275433, 3682761353, 10152454583, 5024164707833, 249908523156563, 5726413266646343, 345878207890067123, 15103232990013860963, 1905274424667036455303, 111502614383457156882293 (list; graph; listen)
OFFSET

1,2

COMMENT

Minimum Chinese Remainder Prime Modulus Ladder: for the n-th term, the number modulus a prime equals the previous prime for the first n primes (the inital term is defined as 1). - Fred Schneider (frederick.william.schneider(AT)gmail.com), Oct 21 2007

LINKS

T. D. Noe, Table of n, a(n) for n=1..100

EXAMPLE

a(3)=23 because that is the smallest number such that n%2 = 1, n%3 = 2 and n%5 = 3

PROGRAM

(PARI) { a(n) = lift(chinese(vector(n, i, Mod(if(i==1, 1, prime(i-1)), prime(i))))) }; vector(30, n, a(n)) [Max Alekseyev, Apr 16 2007]

(PARI) z=Mod(1, 2); forprime(x=3, 100, z=chinese(z, Mod(precprime(x-1), x)); print(lift(z)) - Fred Schneider (frederick.william.schneider(AT)gmail.com), Oct 21 2007

CROSSREFS

Sequence in context: A007836 A054749 A107204 this_sequence A116652 A072104 A086797

Adjacent sequences: A116148 A116149 A116150 this_sequence A116152 A116153 A116154

KEYWORD

nonn

AUTHOR

Christian Bjartli (cbjartli(AT)gmail.com), Apr 14 2007

EXTENSIONS

More terms from Max Alekseyev, Apr 16 2007

Edited by njas, May 05 2007

Further edited by njas, Jun 30 2008 at the suggestion of R. J. Mathar and Christian Bjartli.

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research