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 A114097 #10 Jan 23 2021 17:41:48
%S A114097 1,1,1,2,2,3,4,5,6,8,10,12,14,18,20,25,30,34,40,47,56,63,73,84,95,111,
%T A114097 127,140,161,180,209,230,259,288,322,366,405,443,498,545,618,675,740,
%U A114097 813,894,1002,1084,1181,1304,1410,1569,1706,1833,2001,2169,2409,2569
%N A114097 Number of partitions of n into parts that are distinct mod 10.
%H A114097 Alois P. Heinz, <a href="/A114097/b114097.txt">Table of n, a(n) for n = 0..2900</a> (terms n = 1..600 from Fausto A. C. Cariboni)
%e A114097 a(7)=5 because there are 5 such partition of 7: {7}, {1,6}, {2,5}, {3,4}, {4,2,1}.
%t A114097 << DiscreteMath`Combinatorica`; np[n_]:= Length@Select[Mod[ #,10]& /@ Partitions[n],(Length@# != Length@Union@#)&]; lst = Array[np,50]
%K A114097 nonn
%O A114097 0,4
%A A114097 _Giovanni Resta_, Feb 06 2006
%E A114097 a(0)=1 prepended by _Alois P. Heinz_, Jan 23 2021