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 A114092 #10 Jan 24 2021 09:05:11
%S A114092 1,1,1,2,2,3,3,5,4,6,7,9,7,10,14,14,11,15,25,20,16,21,41,27,22,28,63,
%T A114092 35,29,36,92,44,37,45,129,54,46,55,175,65,56,66,231,77,67,78,298,90,
%U A114092 79,91,377,104,92,105,469,119,106,120,575,135,121,136,696,152
%N A114092 Number of partitions of n into parts that are distinct mod 4.
%H A114092 Alois P. Heinz, <a href="/A114092/b114092.txt">Table of n, a(n) for n = 0..10000</a> (terms n = 1..2000 from Fausto A. C. Cariboni)
%e A114092 a(5)=3 because there are 3 such partition of 5: {5}, {2,3}, {1,4}.
%t A114092 << DiscreteMath`Combinatorica`; np[n_]:= Length@Select[Mod[ #,4]& /@ Partitions[n],(Length@# != Length@Union@#)&]; lst = Array[np,50]
%K A114092 nonn
%O A114092 0,4
%A A114092 _Giovanni Resta_, Feb 06 2006
%E A114092 a(0)=1 prepended by _Alois P. Heinz_, Jan 23 2021