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 A212117 #7 May 03 2012 08:08:13 %S A212117 1,7,17,34,74,113,186,289,434,598,888,1162,1610,2115,2783,3534,4716, %T A212117 5756,7364,9125,11404,13721,17206,20391,24983,29767,35781,41987,50733, %U A212117 58665,69642,80987,95040,109085,128243,145889,169528,193419,222437,251663,290151 %N A212117 Number of partitions of n into exactly 6 different parts with distinct multiplicities. %e A212117 a(56) = 1: [6,5,5,4,4,4,3,3,3,3,2,2,2,2,2,1,1,1,1,1,1]. %e A212117 a(57) = 7: [6,5,5,4,4,4,3,3,3,3,2,2,2,2,2,1,1,1,1,1,1,1],[6,5,5,4,4,4,3,3,3,3,2,2,2,2,2,2,1,1,1,1,1],[6,5,5,4,4,4,3,3,3,3,3,2,2,2,2,1,1,1,1,1,1], %e A212117 [6,5,5,4,4,4,4,3,3,3,2,2,2,2,2,1,1,1,1,1,1], [6,5,5,5,4,4,3,3,3,3,2,2,2,2,2,1,1,1,1,1,1], %e A212117 [6,6,5,4,4,4,3,3,3,3,2,2,2,2,2,1,1,1,1,1,1],[7,5,5,4,4,4,3,3,3,3,2,2,2,2,2,1,1,1,1,1,1]. %Y A212117 Column k=6 of A182485. %K A212117 nonn %O A212117 56,2 %A A212117 _Alois P. Heinz_, May 01 2012