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 A114095 #14 May 25 2022 11:49:25
%S A114095 1,1,2,2,3,4,5,6,7,10,10,13,16,18,21,24,31,31,38,44,49,56,62,76,76,90,
%T A114095 100,113,126,136,161,161,186,201,234,252,267,308,308,349,370,449,462,
%U A114095 483,546,546,609,637,813,792
%N A114095 Number of partitions of n into parts that are distinct mod 7.
%H A114095 Fausto A. C. Cariboni, <a href="/A114095/b114095.txt">Table of n, a(n) for n = 1..1000</a>
%e A114095 a(7)=5 because there are 5 such partitions of 7: {7}, {1,6}, {2,5}, {3,4}, {4,2,1}.
%t A114095 << DiscreteMath`Combinatorica`; np[n_]:= Length@Select[Mod[ #,7]& /@ Partitions[n],(Length@# == Length@Union@#)&]; lst = Array[np,50] (* corrected by _Seth A. Troisi_, May 17 2022 *)
%o A114095 (PARI) a(n) = my(nb=0); forpart(p=n, if (#p == #Set(apply(x->(x%7), Vec(p))), nb++)); nb; \\ _Michel Marcus_, May 18 2022
%K A114095 nonn
%O A114095 1,3
%A A114095 _Giovanni Resta_, Feb 06 2006