The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A192363 (A053664(n+1)-A053664(n)) / A002110(n). 2

%I

%S 2,3,1,7,12,9,8,19,25,0,11,22,26,27,32,54,20,42,21,40,43,56,54,39,53,

%T 94,35,26,31,43,9,87,103,117,69,135,109,15,8,165,127,9,20,6,51,123,40,

%U 223,162,157,202,46,192,141,31,19,219,13,192,203,227,178,30

%N (A053664(n+1)-A053664(n)) / A002110(n).

%H Zak Seidov, <a href="/A192363/b192363.txt">Table n, a(n) for n=1..2000</a>

%e n=1: A053664(n+1)=5, A053664(n)=1, A002110(1)=2, a(1)=(5-1)/2=2

%e n=2: A053664(n+1)=23, A053664(n)=5, A002110(1)=6, a(2)=(23-5)/6=3

%e n=3: A053664(n+1)=53, A053664(n)=23, A002110(1)=30, a(2)=(53-23)/30=1.

%t b=1; a=1; Table[a=a*Prime[k-1]; i=0; While[Mod[b, Prime[k]] != k, i++; b=b+a]; i, {k, 2, 100}]

%o (PARI) m=Mod(1,2);pr=2;for(n=1,100,t=chinese(m,Mod(n+1,prime(n+1)));print1((lift(t)-lift(m))/pr", ");pr*=prime(n+1);m=t) \\ _Charles R Greathouse IV_, Jul 13 2011

%Y Cf. A002110, A053664.

%K nonn

%O 1,1

%A _Zak Seidov_, Jul 11 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 27 19:23 EDT 2021. Contains 347694 sequences. (Running on oeis4.)