|
%I #9 Sep 17 2016 11:55:15
%S 2,5,17,17,17,359,359,359,163,163,163,163,163,163,163,163,163,448,448,
%T 448,448,448,448,71,71,71,17,17,443,443,443,443,443,443,37,37,2789,
%U 2789,2789,2789,2789,2789,2789,2789,2789,2789,2789,2789,2789,2789,2789,2789
%N Let A_n be the sequence defined in the same way as A159559 but with initial term prime(n), n>=2; a(n) is the smallest m such that for i>=2, A_n(i) - A_2(i) <= A_n(m) - A_2(m).
%C By definition, A_2 = A159559.
%e Let n=4. Set r(i)= A_4(i)- A_2(i), i>=2. Then, by the definition of A_4 and A_2, we have
%e r(2)=7-3=4,
%e r(3)=11-5=6, further,
%e r(4)=...=r(12)=6,
%e r(13)=r(14)=10,
%e r(15)=r(16)=11,
%e r(17)=r(18)=14,
%e r(19)=...=r(22)=12,
%e r(23)=...r(26)=10,
%e r(27)=9,
%e r(28)=8,
%e r(29)=...=r(32)=6,
%e r(33)=...=r(36)=7,
%e r(37)=r(38)=8,
%e r(39)=r(40)=7,
%e r(41)=r(42)=4,
%e r(43)=r(44)=2,
%e r(45)=r(46)=1
%e r(n)=0, n>=47.
%e So max r(i)=14 and the smallest m such that r(m)=14 is 17.
%e Thus a(4)=17.
%Y Cf. A159559, A229019, A276703.
%K nonn
%O 2,1
%A _Vladimir Shevelev_, Sep 17 2016
%E More terms from _Peter J. C. Moses_, Sep 17 2016
|
