%I #4 Sep 27 2014 19:03:14
%S 2,3,4,5,7,8,9,11,12,13,15,16,17,18,20,21,22,24,25,26,27,29,30,31,32,
%T 34,35,36,37,39,40,41,42,44,45,46,47,48,50,51,52,53,55,56,57,58,60,61,
%U 62,63,64,66,67,68,69,70,72,73,74,75,77,78,79,80,81,83
%N Numbers k such that A247914(k+1) = A247914(k) + 1.
%C Complement of A247916.
%H Clark Kimberling, <a href="/A247915/b247915.txt">Table of n, a(n) for n = 1..1000</a>
%e A247914(n+1) - A247914(n) = (2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1,...), and a(n) is the position of the n-th 1.
%t $RecursionLimit = Infinity; $MaxExtraPrecision = Infinity;
%t z = 500; u[1] = 0; u[2] = 1; u[n_] := u[n] = u[n - 1] + u[n - 2]/(n - 2);
%t f[n_] := f[n] = Select[Range[z], Abs[(# + 1)/u[# + 1] - E] < n^-n &, 1];
%t u = Flatten[Table[f[n], {n, 1, z}]] (* A247914 *)
%t w = Differences[u]
%t f1 = Flatten[Position[w, 1]] (* A247915 *)
%t f2 = Flatten[Position[w, 2]] (* A247916 *)
%Y Cf. A247908, A247911, A247914, A247916.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Sep 27 2014
|