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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A247909 Numbers k such that A247908(k+1) = A247908(k). 3
 3, 5, 8, 11, 13, 16, 18, 21, 24, 26, 29, 31, 34, 36, 39, 41, 44, 46, 48, 51, 53, 56, 58, 61, 63, 66, 68, 70, 73, 75, 78, 80, 83, 85, 87, 90, 92, 95, 97, 99, 102, 104, 107, 109, 111, 114, 116, 119, 121, 123, 126, 128, 131, 133, 135, 138, 140, 142, 145, 147 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Complement of A247910. LINKS Clark Kimberling, Table of n, a(n) for n = 1..500 EXAMPLE A247908(n+1) - A247908(n) = (1,1,0,1,0,1,1,0,1,1,0,1,0,1,1,0,1,...), and a(n) is the position of the n-th 0. MATHEMATICA \$RecursionLimit = 1000; \$MaxExtraPrecision = 1000; z = 300; 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], E - 2 #/u[2 #] < 1/n^n &, 1]; u = Flatten[Table[f[n], {n, 1, z}]] (* A247908 *) w = Differences[u] Flatten[Position[w, 0]] (* A247909 *) Flatten[Position[w, 1]] (* A247910 *) CROSSREFS Cf. A247908, A247910. Sequence in context: A288474 A310026 A213732 * A184659 A026274 A137910 Adjacent sequences: A247906 A247907 A247908 * A247910 A247911 A247912 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 December 7 05:29 EST 2023. Contains 367630 sequences. (Running on oeis4.)