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 A295342 #5 Nov 20 2017 08:11:37 %S A295342 0,0,0,0,1,1,2,3,6,8,13,18,27,37,53,71,99,131,177,232,307,397,518,663, %T A295342 853,1082,1376,1730,2179,2719,3394,4206,5211,6415,7894,9661,11814, %U A295342 14381,17487,21179,25622,30887,37188,44637,53509,63965,76368,90946,108169,128361 %N A295342 The number of partitions of n in which at least one part is a multiple of 4. %F A295342 a(n) = A000041(n) - A001935(n). %Y A295342 Cf. A047967 (at least one multiple of 2), A295341 (at least one multiple of 3). %K A295342 nonn %O A295342 0,7 %A A295342 _R. J. Mathar_, Nov 20 2017