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 A068906 #12 May 06 2022 12:32:38 %S A068906 0,0,1,0,0,1,0,1,2,1,0,1,0,2,1,0,1,2,3,2,1,0,1,1,1,3,2,1,0,1,2,3,0,3, %T A068906 2,1,0,0,0,3,2,5,3,2,1,0,0,1,3,1,1,5,3,2,1,0,0,0,2,0,5,0,5,3,2,1,0,0, %U A068906 0,2,2,3,4,7,5,3,2,1,0,1,2,2,0,4,1,3,7,5,3,2,1,0,1,2,0,2,0,1,7,2,7,5,3,2,1 %N A068906 Square array read by ascending antidiagonals of partitions of k modulo n. %C A068906 0 is disproportionately common modulo 5, 7 and 11, largely because T(5,5m+4)=T(7,7m+5)=T(11,11m+6)=0. %H A068906 Henry Bottomley, <a href="http://www.se16.info/js/partitions.htm">Partition calculators using java applets</a> %H A068906 <a href="/index/Par#part">Index entries for sequences related to partitions</a> %F A068906 T(n, k) =A051127(n, A000041(k)) %e A068906 Rows start 0,0,0,0,0,...; 1,0,1,1,1,...; 1,2,0,2,1,...; 1,2,3,1,3,...; 1,2,3,0,2,1,...; 1,2,3,5,1,5,...; 1,2,3,5,0,...; 1,2,3,5,7,...; etc. %Y A068906 Rows 2, 3, 5, 7 and 11 give A040051, A068907, A068908, A068909, A020919. %K A068906 nonn,tabl %O A068906 1,9 %A A068906 _Henry Bottomley_, Mar 05 2002