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 A028378 #8 Mar 31 2012 13:21:27 %S A028378 0,1,2,3,5,7,9,14,19,23,28,42,56,66,76,90,132,174,202,227,255,297,429, %T A028378 561,645,715,785,869,1001,1430,1859,2123,2333,2529,2739,3003,3432, %U A028378 4862,6292,7150,7810,8398,8986,9646,10504,11934,16796,21658 %N A028378 Concatenate rows of triangle in A028364 (removing duplicates). %C A028378 a(n+1) is the number of subpartitions of the smallest partition of n into distinct parts (minimizing the size of the largest part). The sequence of partitions is [], [1], [2], [2,1], [3,1], [3,2], [3,2,1], [4,2,1], .... - _Franklin T. Adams-Watters_, Apr 11 2006 %Y A028378 Cf. A028364, A028376. %Y A028378 Cf. A115728, A115729. %K A028378 nonn,easy %O A028378 0,3 %A A028378 _Wouter Meeussen_