cp's OEIS Frontend

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.

A182473 Number of partitions of n into exactly 2 different parts with distinct multiplicities.

This page as a plain text file.
%I A182473 #15 May 25 2014 18:39:59
%S A182473 0,0,0,0,1,3,3,8,9,12,16,22,20,31,35,34,44,51,53,62,65,68,87,86,89,95,
%T A182473 118,108,126,127,138,142,162,154,188,160,193,189,227,204,228,221,258,
%U A182473 238,282,247,311,272,320,284,344,318,373,327,398,334,407,380,450
%N A182473 Number of partitions of n into exactly 2 different parts with distinct multiplicities.
%H A182473 Alois P. Heinz, <a href="/A182473/b182473.txt">Table of n, a(n) for n = 0..3000</a>
%e A182473 a(4) = 1: [2,1,1], part 2 occurs once and part 1 occurs twice.
%e A182473 a(5) = 3: [2,1,1,1], [2,2,1], [3,1,1].
%e A182473 a(6) = 3: [2,1,1,1,1], [3,1,1,1], [4,1,1].
%e A182473 a(7) = 8: [2,1,1,1,1,1], [2,2,1,1,1], [2,2,2,1], [3,1,1,1,1], [3,2,2], [3,3,1], [4,1,1,1], [5,1,1].
%Y A182473 Column k=2 of A182485.
%Y A182473 Cf. A242900 (the same for compositions).
%K A182473 nonn,look
%O A182473 0,6
%A A182473 _Alois P. Heinz_, Apr 30 2012