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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A247915 Numbers k such that A247914(k+1) = A247914(k) + 1. 3
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, 34, 35, 36, 37, 39, 40, 41, 42, 44, 45, 46, 47, 48, 50, 51, 52, 53, 55, 56, 57, 58, 60, 61, 62, 63, 64, 66, 67, 68, 69, 70, 72, 73, 74, 75, 77, 78, 79, 80, 81, 83 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Complement of A247916.
LINKS
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 1.
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
Sequence in context: A039117 A185024 A359913 * A284676 A187681 A107750
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 20 16:16 EDT 2024. Contains 374459 sequences. (Running on oeis4.)