cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A178243 a(2n) = a(n), a(2n+1) = 10*a(n) + a(n+1).

Original entry on oeis.org

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
Offset: 1

Views

Author

Gary W. Adamson, May 29 2010

Keywords

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

Examples

			a(6) = a(3) = 10 since a(2n) = a(n);
a(7) = 111 = 10*a(n) + a(n+1) = 10*11 + 1.
		

Crossrefs

Programs

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

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.

Extensions

More terms from Ilya Gutkovskiy, May 18 2017