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 A357456 #8 Jun 23 2025 15:10:10
%S A357456 0,0,1,1,2,2,4,4,6,7,10,11,15,17,22,26,32,37,46,53,64,75,89,103,122,
%T A357456 141,165,191,222,255,296,339,390,447,512,584,668,759,864,981,1113,
%U A357456 1259,1426,1609,1816,2047,2304,2589,2910,3263,3658,4096,4582,5119,5718,6377,7108
%N A357456 Number of partitions of n into two or more odd parts.
%H A357456 Harmandeep Kaur and Muhammad Asif Rana, <a href="https://arxiv.org/abs/2506.11447">Partitions with unique largest part and their generating functions</a>, arXiv:2506.11447 [math.CO], 2025. See p. 6.
%F A357456 a(n) = A000009(n) - A000035(n) for n > 0.
%t A357456 Table[Count[IntegerPartitions[n], _?(And[Length[#] > 1, AllTrue[#, OddQ]] &)], {n, 0, 56}] (* _Michael De Vlieger_, Jun 23 2025 *)
%Y A357456 Cf. A000009, A000035, A111133, A357457.
%K A357456 nonn
%O A357456 0,5
%A A357456 _Ilya Gutkovskiy_, Sep 29 2022