

A010850


Constant sequence: a(n) = 11.


4



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



OFFSET

0,1


COMMENTS

A156194=1,2,7,1,7,2,1,1,4,2,4,1,; (A156199=1,1,4,2,4,1,1,2,7,1,7,2,; correction in title: A000045 ,not Aoo1045). a(n)=A156194(4n)+A156194(4n+1)+A156194(4n+2)+A156194(4n+3); a(n)=A156199(4n+1)+A156199(4n+2)+A156199(4n+3)+A156199(4n+4). [From Paul Curtz, Feb 06 2009]
Also, binary representation of the nth iteration of the elementary cellular automaton Rules: 116, 212 and 244 starting with a single ON (black) cell.  Robert Price, Feb 21 2016


LINKS

Table of n, a(n) for n=0..64.
Tanya Khovanova, Recursive Sequences
Eric Weisstein's World of Mathematics, Elementary Cellular Automaton
S. Wolfram, A New Kind of Science
Index to Elementary Cellular Automata
Index entries for sequences related to cellular automata
Index to divisibility sequences
Index entries for linear recurrences with constant coefficients, signature (1).


FORMULA

G.f.: 11/(1x).  Vincenzo Librandi, Jan 19 2012


MATHEMATICA

Table[11, {60}] (* Vincenzo Librandi, Jan 19 2012 *)


CROSSREFS

Sequence in context: A084066 A231472 A112122 * A113587 A083971 A240453
Adjacent sequences: A010847 A010848 A010849 * A010851 A010852 A010853


KEYWORD

nonn,easy


AUTHOR

N. J. A. Sloane.


STATUS

approved



