A010850 Constant sequence: a(n) = 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, 11

Offset

0,1

Comments

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

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/(1-x). - Vincenzo Librandi, Jan 19 2012

E.g.f.: 11*exp(x). - Elmo R. Oliveira, Feb 21 2024

Mathematica

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

Crossrefs

Sequence in context: A319150 A112122 A290856 * A317244 A113587 A083971

Adjacent sequences: A010847 A010848 A010849 * A010851 A010852 A010853

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved