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 A096322 #24 May 23 2025 12:04:32
%S A096322 1,3,9,25,66,165,402,943,2163,4835,10598,22785,48215,100470,206620,
%T A096322 419662,842928,1675487,3298688,6436210,12453352,23905923,45550529,
%U A096322 86180937,161964145,302447657
%N A096322 Limiting sequence formed by rows of A094504 read backwards: rightmost floor(n/2)+1 terms of row n in table A094504.
%C A096322 Same sequence, multiplied by four, occurs in A096272.
%C A096322 a(n) is the number of solid partitions with layer structure an integer partition of (2n-2) in exactly (n-1) parts. - _Wouter Meeussen_, Mar 12 2025
%H A096322 Wouter Meeussen, <a href="/A094504/a094504_1.txt">Mma functions for plane and solid partitions</a>
%e A096322 For n=3 the a(3)= 9 solid partitions are generated by the integer partitions of (2n-2) in exactly (n-1) parts with parts =1 and duplicate parts deleted, so just {3} and {2} :
%e A096322 z[{{3}}], z[{{2,1}}], z[{{1,1,1}}], z[{{2},{1}}], z[{{1,1},{1}}], z[{{1},{1},{1}}] and z[{{2}}], z[{{1,1}}], z[{{1},{1}}]
%Y A096322 Cf. A000293, A094504, A094508, A096272, A096573, A096574, A096575, A096576, A096577, A096578, A096579, A096580, A096581.
%K A096322 nonn,hard,more
%O A096322 1,2
%A A096322 _Wouter Meeussen_, Jun 27 2004
%E A096322 Extended to n=26, _Wouter Meeussen_, May 23 2025