|
%I #31 Dec 17 2021 01:42:22
%S 1,1,1,1,2,1,1,3,3,1,1,4,6,4,1,1,5,10,10,5,1,1,6,1,6,1,6,1,1,7,7,7,7,
%T 7,7,1,1,8,0,0,0,0,0,8,1,1,9,8,0,0,0,0,8,9,1,1,10,3,8,0,0,0,8,3,10,1,
%U 1,11,13,11,8,0,0,8,11,13,11,1,1,12,10,10,5,8,0,8,5,10,10,12,1,1,13,8,6,1,13,8,8,13,1,6,8,13,1,1,0,7,0,7,0,7,2,7,0,7,0,7,0,1
%N Triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 14.
%H Ilya Gutkovskiy, <a href="/A275198/a275198.pdf">Illustrations (triangle formed by reading Pascal's triangle mod m)</a>
%H <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>
%F T(n, k) = binomial(n, k) mod 14.
%F a(n) = A070696(A007318(n)).
%e Triangle begins:
%e 1,
%e 1, 1,
%e 1, 2, 1,
%e 1, 3, 3, 1,
%e 1, 4, 6, 4, 1,
%e 1, 5, 10, 10, 5, 1,
%e 1, 6, 1, 6, 1, 6, 1,
%e 1, 7, 7, 7, 7, 7, 7, 1,
%e 1, 8, 0, 0, 0, 0, 0, 8, 1,
%e 1, 9, 8, 0, 0, 0, 0, 8, 9, 1,
%e 1, 10, 3, 8, 0, 0, 0, 8, 3, 10, 1,
%e ...
%t Mod[Flatten[Table[Binomial[n, k], {n, 0, 14}, {k, 0, n}]], 14]
%Y Cf. A007318, A070696.
%Y Sequences based on the triangles formed by reading Pascal's triangle mod m: A047999 (m = 2), A083093 (m = 3), A034931 (m = 4), A095140 (m = 5), A095141 (m = 6), A095142 (m = 7), A034930 (m = 8), A095143 (m = 9), A008975 (m = 10), A095144 (m = 11), A095145 (m = 12), (this sequence) (m = 14), A034932 (m = 16).
%K nonn,tabl
%O 0,5
%A _Ilya Gutkovskiy_, Aug 11 2016
|
