The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213061 Triangle of Stirling numbers of second kind (A048993) read mod 2. 1
 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 (list; table; graph; refs; listen; history; text; internal format)
 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 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 26 08:39 EDT 2020. Contains 334620 sequences. (Running on oeis4.)