A226464 Triangle read by rows giving successive states of cellular automaton generated by "Rule 149".

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

Offset

0

Links

Reinhard Zumkeller, Rows n = 0..120 of triangle, flattened

Eric Weisstein's World of Mathematics, Rule 30

Eric Weisstein's World of Mathematics, Elementary Cellular Automaton

Index entries for sequences related to cellular automata

Formula

T(n,k) = 1 - A070950(n,2*n+1-k), 0 <= k <= 2*n+1.

Example

Initial rows, terms moved together:
.   0:                           0
.   1:                          000
.   2:                         01100
.   3:                        0000100
.   4:                       011101100
.   5:                      00010000100
.   6:                     0110111101100
.   7:                    000000110000100
.   8:                   01111100011101100
.   9:                  0001110110010000100
.  10:                 011001000010111101100
.  11:                00001011110100110000100
.  12:               0111010011001100011101100
.  13:              000100110001000110010000100
.  14:             01101100011011100010111101100
.  15:            0000000110000010110100110000100
.  16:           011111100011110100001100011101100
.  17:          00011110110011001111000110010000100
.  18:         0110011000010001001101100010111101100
.  19:        000010001110111011000000110100110000100
.  20:       01110111001000100001111100001100011101100
.  21:      0001000101011101111001110111000110010000100
.  22:     011011101010010001101001000101100010111101100
.  23:    00000010010110111000011011101000110100110000100
.  24:   0111110110100000101110000010011100001100011101100
.  25:  000111000001111101001011110110010111000110010000100 .

Mathematica

A226464list[rowmax_]:=MapIndexed[ArrayPad[#1, #2-rowmax-1]&, CellularAutomaton[149, {{0}, 1}, rowmax]]; A226464list[10] (* Generates 11 rows *) (* Paolo Xausa, Jun 01 2023 *)

Prog

(Haskell)
a226464 n k = a226464_tabf !! n !! k
a226464_row n = a226464_tabf !! n
a226464_tabf = map reverse a226463_tabf

Crossrefs

Cf. A005408 (row lengths), A070951 (row sums), A226474 central terms), A226463 (mirror image, rule 135), A071032 (complemented, rule 86), A070950 (mirrored and complemented, rule 30).

Sequence in context: A337383 A011667 A144195 * A288665 A011759 A316345

Adjacent sequences: A226461 A226462 A226463 * A226465 A226466 A226467

Keyword

nonn,tabf

Author

Reinhard Zumkeller, Jun 08 2013

Status

approved