This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A093879 First differences of A004001. 16
 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS All the terms are 0 or 1: it is easy to show that if {b(n)} = A004001, b(n)>=b(n-1) and b(n)= 1: a(A087686(n+1)-1) = 0. a(A088359(n)-1) = 1. a(n) = 1 if and only if A051135(n+1) = 1. (End) MATHEMATICA a[1] = a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n - a[n - 1]]; t = Table[a[n], {n, 110}]; Drop[t, 1] - Drop[t, -1] (* Robert G. Wilson v, May 28 2004 *) PROG (PARI) {m=106; v=vector(m, j, 1); for(n=3, m, a=v[v[n-1]]+v[n-v[n-1]]; v[n]=a); for(n=2, m, print1(v[n]-v[n-1], ", "))} (Scheme) (define (A093879 n) (- (A004001 (+ 1 n)) (A004001 n))) ;; Code for A004001 given in that entry. - Antti Karttunen, Jan 18 2016 CROSSREFS Cf. A004001, A051135, A087686, A088359, A188163. Sequence in context: A108737 A165221 A295891 * A117872 A291291 A324681 Adjacent sequences:  A093876 A093877 A093878 * A093880 A093881 A093882 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, May 27 2004 EXTENSIONS More terms and PARI code from Klaus Brockhaus and Robert G. Wilson v, May 27 2004 STATUS approved

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

Last modified October 16 21:10 EDT 2019. Contains 328103 sequences. (Running on oeis4.)