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 A027185 #9 Oct 18 2019 07:58:21 %S A027185 1,0,1,1,0,1,1,0,0,1,3,0,0,0,1,3,1,0,0,0,1,6,1,0,0,0,0,1,7,2,0,0,0,0, %T A027185 0,1,12,2,1,0,0,0,0,0,1,14,4,1,0,0,0,0,0,0,1,22,4,2,0,0,0,0,0,0,0,1, %U A027185 27,6,2,1,0,0,0,0,0,0,0,1,40,7,3,1,0,0,0,0,0,0 %N A027185 Triangular array O by rows: O(n,k) = number of partitions of n into an odd number of parts, the least being k. %F A027185 O(n, k) = E(n-k, k)+E(n-k, k+1)+...+E(n-k, n-k), for 2<=2k<=n, E given by A027186. %F A027185 T(n,k) + A027186(n,k) = A026794(n,k). - _R. J. Mathar_, Oct 18 2019 %e A027185 1, %e A027185 0, 1, %e A027185 1, 0, 1, %e A027185 1, 0, 0, 1, %e A027185 3, 0, 0, 0, 1, %e A027185 3, 1, 0, 0, 0, 1, %e A027185 6, 1, 0, 0, 0, 0, 1, %e A027185 7, 2, 0, 0, 0, 0, 0, 1, %e A027185 12, 2, 1, 0, 0, 0, 0, 0, 1, %e A027185 14, 4, 1, 0, 0, 0, 0, 0, 0, 1, %e A027185 22, 4, 2, 0, 0, 0, 0, 0, 0, 0, 1, %e A027185 27, 6, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1, %e A027185 40, 7, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, %Y A027185 Cf. A027186. %K A027185 nonn,tabl %O A027185 1,11 %A A027185 _Clark Kimberling_