|
%I #4 Jun 05 2015 13:00:25
%S 1,2,3,5,7,9,11,13,15,16,18,20,22,24,26,27,29,31,33,35,37,39,40,42,44,
%T 46,49,51,53,55,57,59,61,63,65,67,69,71,73,75,77,79,81,83,85,87,89,91,
%U 93,95,97,100,102,104,106,108,110,112,113,115,117,119,121
%N Numbers k such that D(prime(k), k-1) > 0, where D( * , k-1) = (k-1)-st difference.
%C Partition of the positive integers: A258036, A258037;
%C Corresponding partition of the primes: A258038, A258039.
%C Conjecture: all the terms of the difference sequence of A258037 belong to {1,2,3}.
%H Clark Kimberling, <a href="/A258037/b258037.txt">Table of n, a(n) for n = 1..1000</a>
%F D(prime(k), k-1) = sum{(-1)^i prime(k-i)*C(k-i),i); i = 0..k-1}
%e D(prime(2), 1) = 3 - 2 > 0, so a(1) = 1;
%e D(prime(3), 2) = 5 - 2*3 + 2 > 0, so a(2) = 2;
%e D(prime(4), 3) = 7 - 3*5 + 3*3 - 2 < 0;
%t u = Table[Prime[Range[k]], {k, 1, 1000}];
%t v = Flatten[Table[Sign[Differences[u[[k]], k - 1]], {k, 1, 100}]];
%t w1 = Flatten[Position[v, -1]] (* A258036 *)
%t w2 = Flatten[Position[v, 1]] (* A258037 *)
%t p1 = Prime[w1] (* A258038 *)
%t p2 = Prime[w2] (* A258039 *)
%Y Cf. A258036, A258038, A258039.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Jun 05 2015
|
