login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A178243 a(2n) = a(n), a(2n+1) = 10*a(n) + a(n+1). 10
1, 1, 11, 1, 21, 11, 111, 1, 31, 21, 221, 11, 221, 111, 1111, 1, 41, 31, 331, 21, 431, 221, 2221, 11, 331, 221, 2321, 111, 2221, 1111, 11111, 1, 51, 41, 441, 31, 641, 331, 3331, 21, 641, 431, 4531, 221, 4431, 2221, 22221, 11, 441, 331, 3531, 221, 4531, 2321, 23321 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Parsed into blocks of 1, 2, 4, 8,...term sums = powers of 12: (1, 12, 144,...).
A178569 is generated from a(2n) = 10*a(n); a(2n+1) = a(n) + a(n+1).
Polcoeff (1 + 10x + 11x^2 + ...) satisfies f(x)/f(x^2) = (1 + x + 10x^2).
Let q(x) = (1 + x + 10*x^2). Then (1 + 10x + 11x^2 + 100x^3 + ...) = q(x) * q(x^2) * q(x^4) * q(x^8) * ...
LINKS
FORMULA
a(2n) = a(n), a(2n+1) = 10*a(n) + a(n+1) = row 10 in the array of A178239.
Let M = an infinite lower triangular matrix with (1, 1, 10, 0, 0, 0,...) in each column, shifted down twice from the previous column. This sequence is Lim_{n->inf} M^n, the left-shifted vector considered as a sequence.
EXAMPLE
a(6) = a(3) = 10 since a(2n) = a(n);
a(7) = 111 = 10*a(n) + a(n+1) = 10*11 + 1.
MATHEMATICA
a[1] = 1; a[n_] := a[n] = If[EvenQ@ n, a[n/2], 10 a[(n - 1)/2] + a[(n - 1)/2 + 1]]; Array[a, 55] (* Michael De Vlieger, May 20 2017 *)
CROSSREFS
Sequence in context: A222803 A201132 A212488 * A040131 A282868 A013618
KEYWORD
nonn
AUTHOR
Gary W. Adamson, May 29 2010
EXTENSIONS
More terms from Ilya Gutkovskiy, May 18 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)