This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A283469 #11 Mar 19 2017 01:08:39
%S A283469 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,
%T A283469 9,9,11,11,13,13,14,15,14,14,15,15,15,15,15,15,15,29,29,30,30,30,31,
%U A283469 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
%N A283469 a(n) = A004001(A004001(n-1)) OR A004001(n-A004001(n-1)), a(1) = a(2) = 1.
%H A283469 Antti Karttunen, <a href="/A283469/b283469.txt">Table of n, a(n) for n = 1..16384</a>
%F A283469 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)
%F A283469 Other identities. For all n >= 1:
%F A283469 a(n) = A283470(n) + A283472(n).
%F A283469 A004001(n) = a(n) + A283472(n).
%t A283469 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 *)
%o A283469 (Scheme)
%o A283469 (define (A283469 n) (if (<= n 2) 1 (A003986bi (A004001 (A004001 (- n 1))) (A004001 (- n (A004001 (- n 1)))))))
%o A283469 ;; A003986bi implements bitwise-OR (see A003986). Code for A004001 given under that entry.
%Y A283469 Cf. A003986, A283470, A283472, A283473 (positions where coincides with A004001).
%K A283469 nonn
%O A283469 1,5
%A A283469 _Antti Karttunen_, Mar 18 2017