Search: id:A157752
Results 1-1 of 1 results found.

%I A157752
%S A157752 2,8,68,1118,2273,197468,1728998,1728998,447914738,10152454583,
%T A157752 1313795640428,97783391392958,5726413266646343,38433316595821418,
%U A157752 15103232990013860963,943894249589930135768,52858423703753671390658
%N A157752 a(n) = smallest integer m == p_i (mod p_(i+1)), i=1..n; p_i = i-th prime.
%C A157752 Suggested by Chinese Remainder Theorem.
%C A157752 a(n) is prime for n = 1, 5, 10, 23, 30.
%t A157752 a[n_] := ChineseRemainder[Prime[Range[n]], Prime[Range[2, n + 1]]] a[ 
               # ] & /@ Range[30]
%o A157752 (PARI) x=Mod(1, 1); for(i=1, 20, x=chinese(x, Mod(prime(i), prime(i+1))); 
               print1(component(x, 2), ", "))
%Y A157752 Cf. A053664 Smallest number m such that m = i mod prime_i for 1<=i<=n. 
               A071057 Smallest number m such that m = p(i+1) mod p(i) for 1<=i<=n. 
               A121934 Smallest positive number m such that m == i mod i+1 for all 
               1<=i<=n.
%Y A157752 Sequence in context: A030445 A093990 A156448 this_sequence A055547 A113087 
               A099729
%Y A157752 Adjacent sequences: A157749 A157750 A157751 this_sequence A157753 A157754 
               A157755
%K A157752 nonn
%O A157752 1,1
%A A157752 Zak Seidov (zakseidov(AT)yahoo.com), Mar 05 2009
%E A157752 Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Oct 
               28 2009

Search completed in 0.001 seconds