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 A270176 #8 May 15 2016 12:41:10 %S A270176 1,2,3,5,7,7,11,16,16,16,16,16,42,42,42,42,52,52,68,80,80,83,84,101, %T A270176 101,101,101,116,116,116,116,116,116,116,116,178,178,178,178,178,178, %U A270176 178,178,178,327,327,327,327,327,327,327,361,386,386,412,412,412,412,412,412,412,412,505,505,505,545,545,545,559,607 %N A270176 Discriminator of the partitions (A000041). %C A270176 The discriminator is the least positive integer k such that the first n terms of the sequence are pairwise incongruent, modulo k. %C A270176 Here we start with p(1), the partition sequence indexed at 1. %Y A270176 Cf. A000041. %K A270176 nonn %O A270176 1,2 %A A270176 _Jeffrey Shallit_, May 15 2016