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 A212115 #5 May 03 2012 08:07:52 %S A212115 1,5,8,17,29,41,59,95,120,170,224,297,367,491,583,764,904,1118,1306, %T A212115 1631,1863,2269,2576,3099,3479,4179,4583,5456,6029,7041,7693,8978, %U A212115 9745,11274,12174,14037,15074,17202,18383,20978,22404,25276,26825,30271,32092,36051 %N A212115 Number of partitions of n into exactly 4 different parts with distinct multiplicities. %e A212115 a(20) = 1: [4,3,3,2,2,2,1,1,1,1]. %e A212115 a(21) = 5: [4,3,3,2,2,2,1,1,1,1,1], [4,3,3,2,2,2,2,1,1,1], [4,3,3,3,2,2,1,1,1,1], [4,4,3,2,2,2,1,1,1,1], [5,3,3,2,2,2,1,1,1,1]. %e A212115 a(22) = 8: [4,3,3,2,2,2,1,1,1,1,1,1], [4,3,3,3,2,2,1,1,1,1,1], [4,4,3,2,2,2,1,1,1,1,1], [4,4,3,2,2,2,2,1,1,1], [5,3,3,2,2,2,1,1,1,1,1], [5,3,3,2,2,2,2,1,1,1], [5,3,3,3,2,2,1,1,1,1], [6,3,3,2,2,2,1,1,1,1]. %Y A212115 Column k=4 of A182485. %K A212115 nonn %O A212115 20,2 %A A212115 _Alois P. Heinz_, May 01 2012