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 A059134 #17 Sep 13 2022 09:35:00
%S A059134 11,32,11,53,11,32,11,74,11,32,11,53,11,32,11,95,11,32,11,53,11,32,11,
%T A059134 74,11,32,11,53,11,32,11,116,11,32,11,53,11,32,11,74,11,32,11,53,11,
%U A059134 32,11,95,11,32,11,53,11,32,11,74,11,32,11,53,11,32,11,137,11,32,11,53,11
%N A059134 A hierarchical sequence (W2{3}c - see A059126).
%H A059134 Jonas Wallgren, <a href="/A059126/a059126.txt">Hierarchical sequences</a>
%F A059134 a((2*n+1)*2^p-1) = 21*p+11 for p >= 0. - _Johannes W. Meijer_, Jan 21 2013
%F A059134 a(n) = Sum_{k=0..6} A059127(7*n+k). - _Sean A. Irvine_, Sep 12 2022
%p A059134 nmax:=68: for p from 0 to ceil(simplify(log[2](nmax))) do for n from 0 to ceil(nmax/(p+2))+1 do a((2*n+1)*2^p-1) := 21*p+11 od: od: seq(a(n), n=0..nmax); # _Johannes W. Meijer_, Jan 21 2013
%Y A059134 Cf. A059126, A059127.
%Y A059134 Cf. A059141 (7*p+11), A059144 (9*p+15), A220466. - _Johannes W. Meijer_, Jan 21 2013
%K A059134 easy,nonn
%O A059134 0,1
%A A059134 _Jonas Wallgren_, Jan 19 2001