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 A092241 #6 Apr 10 2013 12:31:37 %S A092241 0,0,0,0,1,0,1,0,1,1,0,0,1,0,0,1,1,0,2,0,3,0,2,0,1,1,0,0,0,0,1,0,0,0, %T A092241 0,1,1,0,3,2,0,0,3,0,0,2,3,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0,0,1,1,0,4,0, %U A092241 2,0,0,0,3,0,0,0,2,0,4,0,1,1,0,0,3,0,0,6,0,0,7,0,0,6,0,0,3,0,0,1 %N A092241 Triangle read by rows: row n gives coefficients of (1+x+x^2)^n mod n. %e A092241 Triangle begins: %e A092241 [0] %e A092241 [0, 0, 0] %e A092241 [1, 0, 1, 0, 1] %e A092241 [1, 0, 0, 1, 0, 0, 1] %e A092241 [1, 0, 2, 0, 3, 0, 2, 0, 1] %e A092241 [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1] %e A092241 [1, 0, 3, 2, 0, 0, 3, 0, 0, 2, 3, 0, 1] %p A092241 f := n -> seriestolist( series( expand( (1+x+x^2)^n ) mod n, x, 2*n+1)); %Y A092241 Cf. A053200. %K A092241 nonn,tabf %O A092241 0,19 %A A092241 _N. J. A. Sloane_, Feb 20 2004