%I A070198
%S A070198 0,1,5,11,59,59,419,839,2519,2519,27719,27719,360359,360359,360359,
%T A070198 720719,12252239,12252239,232792559,232792559,232792559,232792559,
%U A070198 5354228879,5354228879,26771144399,26771144399,80313433199,80313433199
%N A070198 Smallest nonnegative number m such that m == i mod i+1 for all 1<=i<=n.
%C A070198 "Smallest k such that, for 0 <= i < n, i+1 divides k-i" produces the 
               same sequence.
%C A070198 Suggested by Chinese Remainder Theorem. This sequence can generate others: 
               smallest b(n) such that b(n)==i (mod(i+2)) 1<=i<=n, gives b(1)=1 
               and b(n)=a(n+1)-1 for n>1; smallest c(n) such that c(n)==i (mod(i+3)) 
               1<=i<=n, gives c(1)=1, c(2)=17 and c(n)=a(n+2)-2 for n>2; smallest 
               d(n) such that c(n)==i (mod(i+4)) 1<=i<=n, gives d(1)=1, d(2)=26, 
               d(3)=206 and d(n)=a(n+3)-3 for n>3, etc.
%F A070198 a(n) = LCM(1, 2, 3, ...., n+1)-1 = A003418(n+1)-1.
%e A070198 a(3) = 11 because 11 == 1 mod 2, 11 == 2 mod 3 and 11 == 3 mod 4.
%Y A070198 Cf. A053664.
%Y A070198 Cf. A057825 (indices of primes). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Jan 14 2009]
%Y A070198 Sequence in context: A141496 A060358 A091798 this_sequence A121934 A153812 
               A153209
%Y A070198 Adjacent sequences: A070195 A070196 A070197 this_sequence A070199 A070200 
               A070201
%K A070198 easy,nonn
%O A070198 0,3
%A A070198 Benoit Cloitre (benoit7848c(AT)orange.fr), May 06 2002
%E A070198 Edited by N. J. A. Sloane (njas(AT)research.att.com), Nov 18 2007, at 
               the suggestion of Max Alekseyev.