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 A275808 #10 Aug 11 2016 23:47:37 %S A275808 0,1,2,3,1,0,4,5,6,7,5,4,2,3,0,1,3,2,1,0,3,2,0,1,8,9,10,11,9,8,12,13, %T A275808 14,15,13,12,10,11,8,9,11,10,9,8,11,10,8,9,4,5,6,7,5,4,0,1,2,3,1,0,6, %U A275808 7,4,5,7,6,5,4,7,6,4,5,2,3,0,1,3,2,6,7,4,5,7,6,0,1,2,3,1,0,3,2,1,0,2,3,1,0,3,2,0 %N A275808 a(0) = 0, for n >= 1, a(n) = A275736(n) XOR a(A257684(n)), where XOR is given by A003987. %H A275808 Antti Karttunen, <a href="/A275808/b275808.txt">Table of n, a(n) for n = 0..40320</a> %H A275808 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %F A275808 a(0) = 0, for n >= 1, a(n) = A275736(n) XOR a(A257684(n)), where 2-argument function XOR is given by A003987. %F A275808 a(n) = A248663(A275734(n)). %o A275808 (Scheme, with memoization-macro definec) %o A275808 (definec (A275808 n) (if (zero? n) n (A003987bi (A275736 n) (A275808 (A257684 n))))) ;; Where A003987bi implements bitwise-XOR (A003987) %Y A275808 Cf. A003987, A248663, A257684, A275734, A275736. %Y A275808 Cf. A275809 (positions of zeros), A275810 (and their first differences). %Y A275808 Cf. also A275728. %K A275808 nonn,base %O A275808 0,3 %A A275808 _Antti Karttunen_, Aug 09 2016