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 A328863 #14 Oct 02 2023 20:21:11 %S A328863 1,2,4,6,9,14,19,27,37,50,66,89,115,151,195,252,321,412,520,660,829, %T A328863 1042,1299,1623,2010,2492,3071,3783,4635,5679,6922,8434,10234,12406, %U A328863 14985,18085,21751,26135,31312,37471,44723,53321,63415,75336,89303,105734,124938 %N A328863 Number of partitions of 2n that describe the degree sequence of exactly one labeled multigraph with no loops. %C A328863 Also the number of partitions of 2*n either with largest part equal to n or with three parts and largest part less than n. %H A328863 Peter Kagey, <a href="/A328863/b328863.txt">Table of n, a(n) for n = 1..10000</a> %F A328863 a(n) = A000041(n) + A069905(n). %e A328863 For n = 4, the a(4) = 6 partitions of 2*4 = 8 that describe a degree sequence of exactly one labeled multigraph are %e A328863 4 + 4, %e A328863 4 + 3 + 1, %e A328863 4 + 2 + 2, %e A328863 4 + 2 + 1 + 1, %e A328863 4 + 1 + 1 + 1 + 1, and %e A328863 3 + 3 + 2. %Y A328863 Cf. A000041, A069905, A209816. %K A328863 nonn %O A328863 1,2 %A A328863 _Peter Kagey_, Oct 28 2019