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 A248476 #27 Oct 27 2023 22:13:33
%S A248476 0,0,0,0,0,4,8,30,70,170,340,770,1424,2810,5166,9542,16614,29596,
%T A248476 49952,85610,141604,234622,379218,616008,976134,1549134,2418768,
%U A248476 3771252,5795300,8903306,13497384,20438432,30630108,45789134,67857566,100346480,147170162,215341690
%N A248476 Number of pairs (not necessarily successors) of partitions of n that are incomparable in dominance (natural, majorization) ordering.
%C A248476 a(n) is always even since each incomparable pair (p1,p2) has a distinct companion (p2,p1).
%H A248476 Alois P. Heinz, <a href="/A248476/b248476.txt">Table of n, a(n) for n = 1..200</a> (first 55 terms from Wouter Meeussen)
%H A248476 Wikipedia, <a href="http://en.wikipedia.org/wiki/Dominance_order">Dominance Order</a>
%F A248476 a(n) = p(n)^2 - A182988(n), where p(n) denotes the number of partitions of n, A000041(n).
%t A248476 Table[Count[ Flatten[Outer[dominant , Partitions[n], Partitions[n], 1]], 0], {n, 24}] (* see A248475 for definition of 'dominant' *)
%Y A248476 Cf. A000041, A001255, A182988, A248475, A265508.
%K A248476 nonn
%O A248476 1,6
%A A248476 _Wouter Meeussen_, Oct 07 2014