A269177 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A269177

Numbers that have a finite predecessor in Wolfram's Rule 124 cellular automaton; numbers n for which A269175(n) > 0.

0, 3, 6, 7, 11, 12, 14, 15, 19, 22, 24, 27, 28, 30, 31, 35, 38, 44, 47, 48, 51, 54, 55, 56, 59, 60, 62, 63, 67, 70, 76, 79, 88, 91, 94, 95, 96, 99, 102, 103, 107, 108, 110, 111, 112, 115, 118, 119, 120, 123, 124, 126, 127, 131, 134, 140, 143, 152, 155, 158, 159, 176, 179, 182, 183, 187, 188, 190, 191, 192, 195

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

Sequence A269174 sorted into ascending order with duplicates removed.

The indexing starts from zero, because a(0) = 0 is a special case in this sequence. (Zero is the only number which is its own predecessor).

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..8940

Eric Weisstein's World of Mathematics, Elementary Cellular Automaton

S. Wolfram, A New Kind of Science

Index entries for sequences related to cellular automata

Index to Elementary Cellular Automata