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 A275077 #6 Jul 15 2016 17:00:41
%S A275077 1,1,1,1,1,1,1,1,1,1,1,2,4,8,16,32,64,128,256,512,1024,2560,6400,
%T A275077 16000,40000,100000,250000,625000,1562500,3906250,9765625,29296875,
%U A275077 87890625,263671875,791015625,2373046875,7119140625,21357421875,64072265625,192216796875
%N A275077 Number of set partitions of [n] such that i-j is a multiple of ten for all i,j belonging to the same block.
%H A275077 Alois P. Heinz, <a href="/A275077/b275077.txt">Table of n, a(n) for n = 0..891</a>
%H A275077 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A275077 a(n) = Product_{i=0..9} A000110(floor((n+i)/10)).
%Y A275077 Column k=10 of A275069.
%Y A275077 Cf. A000110.
%K A275077 nonn
%O A275077 0,12
%A A275077 _Alois P. Heinz_, Jul 15 2016