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 A098491 #12 Sep 19 2019 07:57:54 %S A098491 1,0,1,1,2,3,5,6,8,11,15,19,25,32,41,52,66,83,104,129,160,197,242,296, %T A098491 361,438,530,640,770,923,1105,1318,1569,1864,2208,2611,3082,3628,4264, %U A098491 5003,5858,6848,7993,9312,10833,12584,14595,16904,19552,22582,26049 %N A098491 Number of partitions of n with parts occurring at most thrice and an even number of parts. Row sums of A098489. %H A098491 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 A098491 a(n) = (A001935(n)+(-1)^n*A010054(n))/2. - _Vladeta Jovovic_, Sep 16 2004 %Y A098491 Equals A001935 - A098492. Differs from A098492 at triangular indices. %K A098491 nonn %O A098491 0,5 %A A098491 _Ralf Stephan_, Sep 12 2004 %E A098491 More terms from _Vladeta Jovovic_, Sep 16 2004