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 A132157 #16 May 25 2015 03:58:51 %S A132157 4,1,1,1,2,2,1,2,2,1,3,2,1,2,2,1,3,2,1,2,2,3,2,1,2,2,2,1,3,2,1,2,2,3, %T A132157 2,1,2,2,2,1,3,2,2,3,2,1,2,2,2,1,3,2,2,1,2,2,2,3,2,1,2,2,2,1,3,2,2,3, %U A132157 2,1,2,2,2,1,3,2,2,1,2,2,2,3,2,1,3,2,2,3,2,1,2,2,2,1,3,2,2,1,2 %N A132157 a(n) = number of times n occurs in A063882. %C A132157 a(A202016(n)) = 1. [_Reinhard Zumkeller_, Dec 08 2011] %H A132157 N. J. A. Sloane, <a href="/A132157/b132157.txt">Table of n, a(n) for n = 1..200</a> [Taken from the Balamohan et al. reference] %H A132157 B. Balamohan, A. Kuznetsov and S. Tanny, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL10/Tanny/tanny3.html">On the behavior of a variant of Hofstadter's Q-sequence</a>, J. Integer Sequences, Vol. 10 (2007), #07.7.1. %H A132157 <a href="/index/Ho#Hofstadter">Index entries for Hofstadter-type sequences</a> %o A132157 (Haskell) %o A132157 import Data.List (group) %o A132157 a132157 n = a132157_list !! (n-1) %o A132157 a132157_list = (map length) (group a063882_list) %o A132157 -- _Reinhard Zumkeller_, Dec 08 2011 %K A132157 nonn %O A132157 1,1 %A A132157 _N. J. A. Sloane_, Nov 06 2007