A213061 Triangle of Stirling numbers of second kind (A048993) read mod 2.

1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1

Offset

0

Comments

Also parity of triangles A103631, A121314, A133607, A208345. - Philippe Deléham, Jun 04 2012

References

Brand, Neal; Das, Sajal; Jacob, Tom. The number of nonzero entries in recursively defined tables modulo primes. Proceedings of the Twenty-first Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1990). Congr. Numer. 78 (1990), 47--59. MR1140469 (92h:05004).

Links

Table of n, a(n) for n=0..119.

Bill Gosper, Colored illustrations of triangle of Stirling numbers of second kind read mod 2, 3, 4, 5, 6, 7

Example

Triangle starts:
1;
0, 1;
0, 1, 1;
0, 1, 1, 1;
0, 1, 1, 0, 1;
0, 1, 1, 1, 0, 1;
...

Mathematica

Table[Mod[StirlingS2[n, k], 2], {n, 0, 13}, {k, 0, n}] // Flatten (* Michael De Vlieger, Apr 03 2016 *)

Prog

(PARI) for(n=0, 22, for(k=0, n, print1(stirling(n, k, 2) % 2, ", ")); print()); \\ Michel Marcus, Apr 03 2016

Crossrefs

Cf. A008277, A048993, A087748.

Sequence in context: A127822 A111967 A177978 * A110247 A114607 A123110

Adjacent sequences: A213058 A213059 A213060 * A213062 A213063 A213064

Keyword

nonn,tabl

Author

N. J. A. Sloane, Jun 03 2012

Status

approved