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 A098492 #12 Sep 19 2019 07:58:02 %S A098492 0,1,1,2,2,3,4,6,8,11,14,19,25,32,41,53,66,83,104,129,160,198,242,296, %T A098492 361,438,530,640,769,923,1105,1318,1569,1864,2208,2611,3081,3628,4264, %U A098492 5003,5858,6848,7993,9312,10833,12585,14595,16904,19552,22582,26049 %N A098492 Number of partitions of n with parts occurring at most thrice and an odd number of parts. Row sums of A098490. %H A098492 Alex Fink, Richard K. Guy, and Mark Krusemeyer, <a href="https://doi.org/10.11575/cdm.v3i2.61940">Partitions with parts occurring at most thrice</a>, Contributions to Discrete Mathematics, Vol 3, No 2 (2008), pp. 76-114. %F A098492 a(n) = (A001935(n)-(-1)^n*A010054(n))/2. - _Vladeta Jovovic_, Sep 16 2004 %Y A098492 Equals A001935 - A098491. Differs from A098491 at triangular indices. %K A098492 nonn %O A098492 0,4 %A A098492 _Ralf Stephan_, Sep 12 2004