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 A224702 #10 Apr 18 2017 08:39:19
%S A224702 1,1,2,1,2,1,2,2,3,2,2,3,3,3,3,3,4,4,3,4,4,5,4,5,4,5,5,5,6,5,6,5,6,6,
%T A224702 7,6,7,6,7,7,7,7,8,7,8,8,8,8,9,8,9,9,8,10,9,9,10,9,10,10,10,11,10,11,
%U A224702 10,11,11,11,12,11,12,11,12,12,13,12,12,13,13,13,13,13,14,13,14
%N A224702 Number of partition sums between powers of 2 where the partition sums b(k) are A000070 and 2^n <= b(k) < 2^(n+1).
%C A224702 The sequence of partition sums A000070 is a complete sequence.
%H A224702 Vincenzo Librandi, <a href="/A224702/b224702.txt">Table of n, a(n) for n = 0..200</a>
%e A224702 a(11) = 3 as between 2048 and 4096 there are 3 partition sums namely 2087, 2714, 3506.
%t A224702 getterm[n0_] := Sum[PartitionsP[m0], {m0, 0, n0}]; termcount[n1_] := (m1=0; While[getterm[m1]<2^n1, m1++]; m1); Table[termcount[n+1]-termcount[n], {n, 0, 100}]
%Y A224702 Cf. A000070, A036378, A052005
%K A224702 nonn
%O A224702 0,3
%A A224702 _Frank M Jackson_, Apr 16 2013