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 A275074 #7 Jul 15 2016 16:54:54
%S A275074 1,1,1,1,1,1,1,1,2,4,8,16,32,64,128,320,800,2000,5000,12500,31250,
%T A275074 78125,234375,703125,2109375,6328125,18984375,56953125,170859375,
%U A275074 592312500,2053350000,7118280000,24676704000,85545907200,296559144960,1028071702528
%N A275074 Number of set partitions of [n] such that i-j is a multiple of seven for all i,j belonging to the same block.
%H A275074 Alois P. Heinz, <a href="/A275074/b275074.txt">Table of n, a(n) for n = 0..826</a>
%H A275074 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A275074 a(n) = Product_{i=0..6} A000110(floor((n+i)/7)).
%e A275074 a(9) = 4: 18|29|3|4|5|6|7, 18|2|3|4|5|6|7|9, 1|29|3|4|5|6|7|8, 1|2|3|4|5|6|7|8|9.
%Y A275074 Column k=7 of A275069.
%Y A275074 Cf. A000110.
%K A275074 nonn
%O A275074 0,9
%A A275074 _Alois P. Heinz_, Jul 15 2016