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 A319925 #5 Oct 01 2018 21:17:39 %S A319925 0,1,1,2,2,5,4,10,10,18,19,38,35,62,71,113,122,199,213,329 %N A319925 Number of integer partitions with no 1's whose parts can be combined together using additions and multiplications to obtain n. %C A319925 All parts of the partition must be used in such a combination. %F A319925 a(n) >= A001055(n). %F A319925 a(n) >= A002865(n). %e A319925 The a(8) = 10 partitions (which are not all partitions of 8): %e A319925 (8), %e A319925 (42), (62), (53), (44), %e A319925 (222), (322), (422), (332), %e A319925 (2222). %e A319925 For example, this list contains (322) because we can write 8 = 3*2+2. %Y A319925 Cf. A000792, A001970, A002865, A005520, A048249, A066739, A275870, A319850, A318949, A319909, A319910, A319912, A319913. %K A319925 nonn,more %O A319925 1,4 %A A319925 _Gus Wiseman_, Oct 01 2018