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 A027186 #7 Oct 18 2019 07:58:53 %S A027186 0,1,0,1,0,0,2,1,0,0,2,1,0,0,0,4,1,1,0,0,0,5,1,1,0,0,0,0,8,2,1,1,0,0, %T A027186 0,0,10,2,1,1,0,0,0,0,0,16,3,1,1,1,0,0,0,0,0,20,4,1,1,1,0,0,0,0,0,0, %U A027186 29,6,2,1,1,1,0,0,0,0,0,0,37,7,2,1,1,1,0,0,0,0 %N A027186 Triangular array E by rows: E(n,k) = number of partitions of n into an even number of parts, the least being k. %F A027186 E(n, k) = O(n-k, k)+O(n-k, k+1)+...+O(n-k, n-k), for 2<=2k<=n, O given by A027185. %e A027186 0, %e A027186 1, 0, %e A027186 1, 0, 0, %e A027186 2, 1, 0, 0, %e A027186 2, 1, 0, 0, 0, %e A027186 4, 1, 1, 0, 0, 0, %e A027186 5, 1, 1, 0, 0, 0, 0, %e A027186 8, 2, 1, 1, 0, 0, 0, 0, %e A027186 10, 2, 1, 1, 0, 0, 0, 0, 0, %e A027186 16, 3, 1, 1, 1, 0, 0, 0, 0, 0, %e A027186 20, 4, 1, 1, 1, 0, 0, 0, 0, 0, 0, %e A027186 29, 6, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, %e A027186 37, 7, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, %Y A027186 Cf. A027185. %K A027186 nonn,tabl %O A027186 1,7 %A A027186 _Clark Kimberling_