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 A059127 #16 Nov 03 2018 06:10:36
%S A059127 1,2,1,3,1,2,1,4,5,4,6,4,5,4,1,2,1,3,1,2,1,7,8,7,9,7,8,7,1,2,1,3,1,2,
%T A059127 1,4,5,4,6,4,5,4,1,2,1,3,1,2,1,10,11,10,12,10,11,10,1,2,1,3,1,2,1,4,5,
%U A059127 4,6,4,5,4,1,2,1,3,1,2,1,7,8,7,9,7,8,7,1,2,1,3,1,2,1,4,5,4,6,4,5,4,1,2,1
%N A059127 A hierarchical sequence (W2{3} - see A059126).
%H A059127 Antti Karttunen, <a href="/A059127/b059127.txt">Table of n, a(n) for n = 0..14335</a>
%H A059127 J. Wallgren, <a href="/A059126/a059126.txt">Hierarchical sequences</a>
%F A059127 a(7n+3) = 3*A001511(1+n), a(7n) = a(7n+2) = a(7n+4) = a(7n+6) = a(7n+3)-2, a(7n+1) = a(7n+5) = a(7n+3)-1. - _Antti Karttunen_, May 28 2017
%t A059127 Block[{m = 3, i = 7, a}, a = IntegerExponent[2 Range@ i, 2]; Array[IntegerExponent[2 #, 2] /. k_ :> (a + m k - m) &, 15]] // Flatten (* _Michael De Vlieger_, Nov 02 2018 *)
%o A059127 (Scheme, with memoization-macro definec)
%o A059127 (definec (A059127 n) (case (modulo n 7) ((3) (* 3 (A001511 (/ (+ 4 n) 7)))) ((0) (+ -2 (A059127 (+ 3 n)))) ((2 4 6) (A059127 (- n (modulo n 7)))) ((1 5) (+ 1 (A059127 (- n 1))))))
%o A059127 ;; _Antti Karttunen_, May 28 2017
%Y A059127 Cf. A001511, A059126, A059128, A059129, A059130, A059134, A059135.
%K A059127 easy,nonn
%O A059127 0,2
%A A059127 _Jonas Wallgren_, Jan 19 2001