|
%I #38 Feb 21 2024 11:50:50
%S 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,
%T 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,
%U 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11
%N Constant sequence: a(n) = 11.
%C Also, binary representation of the n-th iteration of the elementary cellular automaton Rules: 116, 212 and 244 starting with a single ON (black) cell. - _Robert Price_, Feb 21 2016
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>
%H <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H <a href="/index/Di#divseq">Index to divisibility sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%F G.f.: 11/(1-x). - _Vincenzo Librandi_, Jan 19 2012
%F E.g.f.: 11*exp(x). - _Elmo R. Oliveira_, Feb 21 2024
%t Table[11,{60}] (* _Vincenzo Librandi_, Jan 19 2012 *)
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
|
