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 A061986 #4 Jul 30 2017 23:05:27 %S A061986 1,1,1,1,2,0,2,1,3,0,0,4,2,0,0,6,0,0,0,3,5,4,0,0,0,0,0,12,0,0,0,0,6,0, %T A061986 0,0,10,8,0,0,0,0,0,0,0,0,0,9,15,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,20,16, %U A061986 0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,0,0,0,0,30,0,0,0,0,0,0,24,0,0,0,0,0,0 %N A061986 Number of times n appears in sequence b(k) = 1 + b(floor(k/2)) + b(floor(k/3)) with b(0) = 0, i.e., in A061984. %F A061986 If n is not in A061985 then a(n)=0, otherwise if n=A061985(m) then a(n) = A061987(m). %K A061986 nonn %O A061986 0,5 %A A061986 _Henry Bottomley_, May 24 2001