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 A027360 #14 Oct 30 2019 01:36:43 %S A027360 1,0,0,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,2,2,2,2,2,1, %T A027360 1,0,2,2,2,2,2,1,1,1,1,2,2,2,2,2,2,2,1,1,0,2,2,2,2,2,2,2,1,1,1,1,3,3, %U A027360 3,3,3,3,3,2,2,1,1,0,3,3,3,3,3,3,3,2,2,1,1,1 %N A027360 Triangular array T read by rows: T(n,k) = number of partitions of n into distinct odd parts, the greatest being >= k. %F A027360 T(n, k) = A000700(n) - A027359(n, k-1). - _Sean A. Irvine_, Oct 29 2019 %K A027360 nonn,tabl %O A027360 1,29 %A A027360 _Clark Kimberling_