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 A275075 #6 Jul 15 2016 16:55:13
%S A275075 1,1,1,1,1,1,1,1,1,2,4,8,16,32,64,128,256,640,1600,4000,10000,25000,
%T A275075 62500,156250,390625,1171875,3515625,10546875,31640625,94921875,
%U A275075 284765625,854296875,2562890625,8884687500,30800250000,106774200000,370150560000,1283188608000
%N A275075 Number of set partitions of [n] such that i-j is a multiple of eight for all i,j belonging to the same block.
%H A275075 Alois P. Heinz, <a href="/A275075/b275075.txt">Table of n, a(n) for n = 0..850</a>
%H A275075 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A275075 a(n) = Product_{i=0..7} A000110(floor((n+i)/8)).
%e A275075 a(9) = 2: 19|2|3|4|5|6|7|8, 1|2|3|4|5|6|7|8|9.
%Y A275075 Column k=8 of A275069.
%Y A275075 Cf. A000110.
%K A275075 nonn
%O A275075 0,10
%A A275075 _Alois P. Heinz_, Jul 15 2016