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 A114096 #8 Apr 17 2021 12:58:07
%S A114096 1,1,2,2,3,4,5,6,8,9,12,13,16,20,23,26,31,37,42,47,54,65,72,80,90,108,
%T A114096 115,129,145,168,184,200,220,259,270,301,336,375,411,436,477,546,568,
%U A114096 631,700,755,832,862,945,1050
%N A114096 Number of partitions of n into parts that are distinct mod 8.
%H A114096 Fausto A. C. Cariboni, <a href="/A114096/b114096.txt">Table of n, a(n) for n = 1..800</a>
%e A114096 a(7)=5 because there are 5 such partition of 7: {7}, {1,6}, {2,5}, {3,4}, {4,2,1}.
%t A114096 << DiscreteMath`Combinatorica`; np[n_]:= Length@Select[Mod[ #,8]& /@ Partitions[n],(Length@# != Length@Union@#)&]; lst = Array[np,50]
%t A114096 Table[Count[IntegerPartitions[n],_?(Max[Tally[Mod[#,8]][[All,2]]]==1&)],{n,50}] (* _Harvey P. Dale_, Apr 17 2021 *)
%K A114096 nonn
%O A114096 1,3
%A A114096 _Giovanni Resta_, Feb 06 2006