A283469 a(n) = A004001(A004001(n-1)) OR A004001(n-A004001(n-1)), a(1) = a(2) = 1.

1, 1, 1, 1, 3, 2, 2, 2, 3, 3, 7, 7, 4, 4, 4, 4, 5, 5, 7, 7, 7, 7, 14, 14, 15, 15, 15, 8, 8, 8, 8, 8, 9, 9, 11, 11, 13, 13, 14, 15, 14, 14, 15, 15, 15, 15, 15, 15, 15, 29, 29, 30, 30, 30, 31, 31, 31, 31, 16, 16, 16, 16, 16, 16, 17, 17, 19, 19, 21, 21, 21, 23, 22, 23, 26, 26, 27, 27, 27, 27, 30, 31, 31, 31, 31, 31, 31, 30, 31, 31, 31, 31, 31

Offset

1,5

Links

Antti Karttunen, Table of n, a(n) for n = 1..16384

Formula

a(1) = a(2) = 1; for n > 2, a(n) = A004001(A004001(n-1)) OR A004001(A080677(n-1)), where OR is bitwise-or (A003986)

Other identities. For all n >= 1:

a(n) = A283470(n) + A283472(n).

A004001(n) = a(n) + A283472(n).

Mathematica

a[n_] := a[n] = If[n <= 2, 1, a[a[n - 1]] + a[n - a[n - 1]]]; Table[BitOr[a[#], a[n - #]] &@ a[n - 1], {n, 93}] (* Michael De Vlieger, Mar 18 2017, after Robert G. Wilson v at A004001 *)

Prog

(Scheme)
(define (A283469 n) (if (<= n 2) 1 (A003986bi (A004001 (A004001 (- n 1))) (A004001 (- n (A004001 (- n 1)))))))
;; A003986bi implements bitwise-OR (see A003986). Code for A004001 given under that entry.

Crossrefs

Cf. A003986, A283470, A283472, A283473 (positions where coincides with A004001).

Sequence in context: A335171 A259652 A141070 * A163751 A067279 A106267

Adjacent sequences: A283466 A283467 A283468 * A283470 A283471 A283472

Keyword

nonn

Author

Antti Karttunen, Mar 18 2017

Status

approved