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

Author

N. J. A. Sloane

Keywords

• nonn
• easy

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

• 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).

Programs

Mathematica

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

Formula

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

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