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.

A274743 Repunits with odd indices multiplied by 99, i.e., 99*(1, 111, 11111, 1111111, ...).

Original entry on oeis.org

99, 10989, 1099989, 109999989, 10999999989, 1099999999989, 109999999999989, 10999999999999989, 1099999999999999989, 109999999999999999989, 10999999999999999999989, 1099999999999999999999989, 109999999999999999999999989, 10999999999999999999999999989
Offset: 1

Views

Author

Rodolfo A. Fiorini, Jul 04 2016

Keywords

Comments

It is apparent that the reciprocals of the terms in the sequence give an increasing sequence of periodic terms similar to A095372, but with the initial term equal to "01". The leading zero is important (see links). Furthermore, the reciprocals of the terms give a sequence of even growing periods, starting from 2, with delta = 4 (i.e., 2, 6, 10, 14, 18, ...).
Adding "11" to each term gives the binary representation of the n-th iteration of "Rule 14" elementary cellular automaton starting with a single ON (black cell) as in A266299.

Examples

			a(2) = 101*10989 - 100*99 = 1099989.
		

Crossrefs

Programs

Formula

a(n) = 101*a(n-1) - 100*a(n-2) for n>2, with a(0)= 99 and a(1)= 10989.
a(n) = 99*A100706(n-1).
G.f.: 99*x*(1 + 10*x)/((1 - x)*(1 - 100*x)). - Ilya Gutkovskiy, Jul 04 2016
a(n) = 11*(10^(2*n-1)-1). - Wesley Ivan Hurt, Jul 04 2016
E.g.f.: 11*(9 - 10*exp(x) + exp(100*x))/10. - Stefano Spezia, Aug 05 2024