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 A059132 #20 Sep 13 2022 09:34:49
%S A059132 4,10,4,16,4,10,4,22,4,10,4,16,4,10,4,28,4,10,4,16,4,10,4,22,4,10,4,
%T A059132 16,4,10,4,34,4,10,4,16,4,10,4,22,4,10,4,16,4,10,4,28,4,10,4,16,4,10,
%U A059132 4,22,4,10,4,16,4,10,4,40,4,10,4,16,4,10,4,22,4,10,4,16,4,10,4,28,4,10,4,16
%N A059132 A hierarchical sequence (W2{2}c - see A059126).
%H A059132 Antti Karttunen, <a href="/A059132/b059132.txt">Table of n, a(n) for n = 0..16383</a>
%H A059132 Jonas Wallgren, <a href="/A059126/a059126.txt">Hierarchical sequences</a>
%F A059132 a(n) = 4 + 6*A007814(n+1). a(2n) = 4, a(2n+1) = a(n) + 6. - _Ralf Stephan_, Oct 09 2003. Typo in the first formula corrected by _Antti Karttunen_, Nov 01 2018
%F A059132 a(n) = A059126(3*n) + A059126(3*n+1) + A059126(3*n+2). - _Sean A. Irvine_, Sep 12 2022
%t A059132 Array[6 IntegerExponent[2 #, 2] - 2 &, 105] (* _Michael De Vlieger_, Nov 02 2018 *)
%o A059132 (PARI) A059132(n) = if(!(n%2), 4, 6+A059132((n-1)/2)); \\ _Antti Karttunen_, Nov 01 2018
%Y A059132 Cf. A007814, A059126, A059134, A059137, A059139.
%K A059132 easy,nonn
%O A059132 0,1
%A A059132 _Jonas Wallgren_, Jan 19 2001