%I A092241
%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,
%U A092241 0,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.
%Y A092241 Sequence in context: A133735 A095704 A163496 this_sequence A128144 A128145
A128143
%Y A092241 Adjacent sequences: A092238 A092239 A092240 this_sequence A092242 A092243
A092244
%K A092241 nonn
%O A092241 0,19
%A A092241 N. J. A. Sloane (njas(AT)research.att.com), Feb 20 2004
|