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 A235037 #8 Jan 07 2014 04:27:23
%S A235037 1,2,2,2,2,3,3,3,3,3,3,3,3,3,4,4,4,4,4,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,
%T A235037 6,6,6,6,6,6,6,7,7,7,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,9,9,9,
%U A235037 9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10
%N A235037 Number of terms of A014847 that are not greater than n.
%H A235037 Bruno Berselli, <a href="/A235037/b235037.txt">Table of n, a(n) for n = 1..2000</a>
%e A235037 a(6)=3 because the terms of A014847 not greater than 6 are 1,2,6.
%e A235037 a(17)=4 because the terms of A014847 not greater than 17 are 1,2,6,15.
%t A235037 a[n_] := Module[{ris}, ris = {}; Do[If[Mod[Binomial[2 k, k], k] == 0, AppendTo[ris, k]], {k, n}]; Length[ris]]; Table[a[n], {n, 100}]
%Y A235037 Cf. A014847.
%K A235037 nonn
%O A235037 1,2
%A A235037 _Bruno Berselli_, Jan 05 2014 - sequence suggested by Umberto Cerruti (University of Turin, Italy)