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 A268346 #6 Feb 04 2016 14:14:45
%S A268346 2,5,9,17,27,42,64,93,132,185,254,343,459,605,790,1024,1314,1673,2118,
%T A268346 2661,3324,4132,5107,6282,7695,9383,11396,13792,16629,19982,23938,
%U A268346 28586,34037,40420,47868,56546,66640,78348,91908,107589,125680,146522,170499,198027
%N A268346 Number of partitions of (3, n) into a sum of distinct pairs.
%H A268346 Vaclav Kotesovec, <a href="/A268346/b268346.txt">Table of n, a(n) for n = 0..10000</a>
%F A268346 a(n) ~ 3^(1/4) * n^(3/4) * exp(Pi*sqrt(n/3)) / Pi^3.
%t A268346 max=50; col=3; s1=Series[Product[(1+x^(n-k)*y^k), {n, 1, max+2}, {k, 0, n}], {y, 0, col}]//Normal; s2=Series[s1, {x, 0, max+1}]; a[n_]:=SeriesCoefficient[s2, {x, 0, n}, {y, 0, col}]; Table[a[n], {n, 0, max}] (* after _Jean-François Alcover_ *)
%t A268346 nmax = 50; CoefficientList[Series[((2 + x - x^2 - x^3 - x^4 + x^5) / ((1 - x)*(1 - x^2)*(1 - x^3))) * Product[1 + x^k, {k, 1, nmax}], {x, 0, nmax}], x]
%Y A268346 Column 3 of A054242.
%K A268346 nonn
%O A268346 0,1
%A A268346 _Vaclav Kotesovec_, Feb 02 2016