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 A228720 #27 Sep 14 2013 12:46:08 %S A228720 1,2,2,3,3,4,4,5,5,5,5,6,6,6,6,7,7,7,7,7,7,8,8,9,9,9,9,10,10,10,10,11, %T A228720 11,11,11,11,11,11,11,11,11,11,11,12,12,12,12,13,13,13,13,13,13,13,13, %U A228720 14,14,14,14,14,14,14,14,15,15,15,15,15,15,15 %N A228720 Number of partitions in the first n compositions of j, according with the ordering of A228525, if 1<=n<=2^(j-1). %C A228720 For a program, see A228525. %F A228720 a(2^(n-1)) = A000041(n), n >= 1. %e A228720 For n = 13 there are only six partitions in the first 13 rows of the list of compositions of any integer >= 5, so a(13) = 6. %e A228720 --------------------------------------------------------- %e A228720 . | Compositions of j %e A228720 . | %e A228720 n a(n) A228354 | 1 2 3 4 5 %e A228720 --------------------------------------------------------- %e A228720 . %e A228720 1 1 * 1 1 1+1 1+1+1 1+1+1+1 1+1+1+1+1 %e A228720 2 2 * 2 2 2+1 2+1+1 2+1+1+1 %e A228720 3 2 1+2 1+2+1 1+2+1+1 %e A228720 4 3 * 4 3 3+1 3+1+1 %e A228720 5 3 1+1+2 1+1+2+1 %e A228720 6 4 * 6 2+2 2+2+1 %e A228720 7 4 1+3 1+3+1 %e A228720 8 5 * 8 4 4+1 %e A228720 9 5 1+1+1+2 %e A228720 10 5 2+1+2 %e A228720 11 5 1+2+2 %e A228720 12 6 * 12 3+2 %e A228720 13 6 1+1+3 %e A228720 14 6 2+3 %e A228720 15 6 1+4 %e A228720 16 7 * 16 5 %e A228720 ... %Y A228720 Where records occur here are in A228354. %Y A228720 Cf. A000041, A011782, A211992, A228525. %K A228720 nonn %O A228720 1,2 %A A228720 _Omar E. Pol_, Aug 30 2013