|
%I M4806 #16 Nov 22 2018 02:40:26
%S 1,11,121,1001,11011,121121,1002001,11022011,121212121,1000000001,
%T 11000000011,121000000121,1001000001001,11011000011011,
%U 121121000121121,1002001001002001,11022011011022011,121212121121212121,1000000002000000001,11000000022000000011,121000000212000000121
%N Rows of Pascal's triangle mod 3.
%D C. Pickover, Mazes for the Mind, St. Martin's Press, NY, 1992, p. 353.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%t a[n_] := FromDigits[Table[Mod[Binomial[n, k], 3], {k, 0, n}]]; Array[a, 25, 0] (* _Amiram Eldar_, Nov 22 2018 *)
%o (PARI) a(n)=fromdigits(apply(x->x%3, binomial(n))); \\ _Michel Marcus_, Nov 21 2018
%Y Cf. A007318.
%K nonn
%O 0,2
%A _N. J. A. Sloane_
%E More terms from _Michel Marcus_, Nov 21 2018
|
