The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A247916 Numbers k such that A247914(k+1) = A247914(k) + 1. 3
 1, 6, 10, 14, 19, 23, 28, 33, 38, 43, 49, 54, 59, 65, 71, 76, 82, 88, 94, 100, 106, 112, 118, 124, 130, 136, 143, 149, 155, 162, 168, 174, 181, 187, 194, 201, 207, 214, 221, 227, 234, 241, 248, 254, 261, 268, 275, 282, 289, 296, 303, 310, 317, 324, 331, 338 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Complement of A247915. LINKS Clark Kimberling, Table of n, a(n) for n = 1..100 EXAMPLE 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 2. MATHEMATICA \$RecursionLimit = Infinity; \$MaxExtraPrecision = Infinity; z = 500; u[1] = 0; u[2] = 1; u[n_] := u[n] = u[n - 1] + u[n - 2]/(n - 2); f[n_] := f[n] = Select[Range[z], Abs[(# + 1)/u[# + 1] - E] < n^-n &, 1]; u = Flatten[Table[f[n], {n, 1, z}]] (* A247914 *) w = Differences[u] f1 = Flatten[Position[w, 1]] (* A247915 *) f2 = Flatten[Position[w, 2]] (* A247916 *) CROSSREFS Cf. A247908, A247911, A247914, A247915. Sequence in context: A315192 A315193 A284675 * A315194 A315195 A315196 Adjacent sequences: A247913 A247914 A247915 * A247917 A247918 A247919 KEYWORD nonn,easy AUTHOR Clark Kimberling, Sep 27 2014 STATUS approved

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

Last modified June 10 08:10 EDT 2023. Contains 363196 sequences. (Running on oeis4.)