|
%I #5 Feb 23 2016 12:09:25
%S 0,3,6,7,11,12,14,15,19,22,24,27,28,30,35,38,44,47,48,51,54,55,56,60,
%T 67,70,76,79,88,91,94,95,96,99,102,103,107,108,110,111,112,119,120,
%U 131,134,140,143,152,155,158,159,176,179,182,183,187,188,190,191,192,195,198,199,203,204,206,207,211,214,216,219
%N Numbers that have a unique finite predecessor in Wolfram's Rule 124 cellular automaton; numbers n for which A269175(n) = 1.
%C 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).
%H Antti Karttunen, <a href="/A269178/b269178.txt">Table of n, a(n) for n = 0..5141</a>
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A269178 (ZERO-POS 0 0 (COMPOSE -1+ A269175)))
%Y Cf. A269174, A269175.
%Y Subsequence of A269177.
%K nonn
%O 0,2
%A _Antti Karttunen_, Feb 22 2016
|
