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 A351742 #12 Feb 17 2022 18:34:12
%S A351742 1,0,0,0,1,0,0,0,1,1,0,0,1,1,0,0,1,1,1,0,1,1,1,0,2,1,1,1,2,1,1,1,2,2,
%T A351742 1,1,3,2,1,1,3,2,2,1,3,3,2,1,4,3,2,2,4,3,3,2,4,4,3,2,5,4,3,3,5,4,4,3,
%U A351742 5,5,4,3,7,5,4,4,7,5,5,4,7,7,5,4,8,7,5
%N A351742 Number of partitions of 2n into n parts of size 1, 5, 10 or 25.
%H A351742 Alois P. Heinz, <a href="/A351742/b351742.txt">Table of n, a(n) for n = 0..10000</a>
%H A351742 <a href="/index/Rec#order_37">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,1,0,0,0,0,1,0,0,0,-1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,-1,0,0,0,0,-1,0,0,0,1).
%F A351742 G.f.: -1/(x^37-x^33-x^28+x^24-x^13+x^9+x^4-1).
%F A351742 a(n) = A351725(2n,n).
%e A351742 a(0) = 1: [].
%e A351742 a(4) = 1: [{5}^1,{1}^3].
%e A351742 a(24) = 2: [{5}^6,{1}^18], [{25}^1,{1}^23].
%e A351742 a(36) = 3: [{5}^9,{1}^27], [{10}^4,{1}^32], [{25}^1,{5}^3,{1}^32].
%Y A351742 Cf. A351725.
%K A351742 nonn,easy
%O A351742 0,25
%A A351742 _Alois P. Heinz_, Feb 17 2022