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 A114093 #6 Jan 23 2021 07:31:18
%S A114093 1,1,2,2,3,4,4,6,6,8,10,10,13,13,18,20,20,24,24,36,35,35,40,40,66,56,
%T A114093 56,62,62,113,84,84,91,91,183,120,120,128,128,283,165,165,174,174,421,
%U A114093 220,220,230,230,606
%N A114093 Number of partitions of n into parts that are distinct mod 5.
%H A114093 Fausto A. C. Cariboni, <a href="/A114093/b114093.txt">Table of n, a(n) for n = 1..2000</a>
%e A114093 a(5)=3 because there are 3 such partition of 5: {5}, {2,3}, {1,4}.
%t A114093 << DiscreteMath`Combinatorica`; np[n_]:= Length@Select[Mod[ #,5]& /@ Partitions[n],(Length@# != Length@Union@#)&]; lst = Array[np,50]
%K A114093 nonn
%O A114093 1,3
%A A114093 _Giovanni Resta_, Feb 06 2006