The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A283472 a(n) = A004001(A004001(n-1)) AND A004001(n-A004001(n-1)), a(1) = a(2) = 0. 6
 0, 0, 1, 1, 0, 2, 2, 2, 2, 3, 0, 0, 4, 4, 4, 4, 4, 5, 4, 5, 5, 6, 0, 0, 0, 0, 0, 8, 8, 8, 8, 8, 8, 9, 8, 9, 8, 8, 8, 8, 10, 10, 10, 11, 11, 12, 12, 12, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 16, 16, 16, 16, 16, 16, 17, 16, 17, 16, 17, 17, 16, 18, 18, 16, 16, 16, 17, 18, 18, 16, 16, 16, 17, 17, 17, 18, 20, 20, 20, 21, 22, 22, 24, 24, 24, 24 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 FORMULA a(1) = a(2) = 0; for n > 2, a(n) = A004001(A004001(n-1)) AND A004001(A080677(n-1)), where AND is bitwise-and (A004198). Other identities. For all n >= 1: a(n) = A283469(n) - A283470(n). A004001(n) = A283469(n) + a(n) = A283470(n) + 2*a(n). MATHEMATICA a[n_] := a[n] = If[n <= 2, 1, a[a[n - 1]] + a[n - a[n - 1]]]; Table[BitAnd[a[#], a[n - #]] &@ a[n - 1] - Boole[n <= 2], {n, 97}] (* Michael De Vlieger, Mar 18 2017, after Robert G. Wilson v at A004001 *) PROG (Scheme) (define (A283472 n) (if (<= n 2) 0 (A004198bi (A004001 (A004001 (- n 1))) (A004001 (- n (A004001 (- n 1))))))) ;; A004198bi implements bitwise-AND (see A004198). Code for A004001 given under that entry. CROSSREFS Cf. A004001, A004198, A283469, A283470, A283473 (positions of zeros). Sequence in context: A270374 A067089 A090872 * A225538 A212355 A238646 Adjacent sequences:  A283469 A283470 A283471 * A283473 A283474 A283475 KEYWORD nonn AUTHOR Antti Karttunen, Mar 18 2017 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 May 26 18:08 EDT 2020. Contains 334630 sequences. (Running on oeis4.)