A163449 A007582 written in base 2.

1, 11, 1010, 100100, 10001000, 1000010000, 100000100000, 10000001000000, 1000000010000000, 100000000100000000, 10000000001000000000, 1000000000010000000000, 100000000000100000000000, 10000000000001000000000000, 1000000000000010000000000000

Offset: 0

Author

Jaroslav Krizek, Jul 27 2009

Keywords

• nonn
• base
• easy

Comments

For n >= 1, the digits are a "1", (n-1) times "0", a "1", and (n-1) times "0".

Links

• G. C. Greubel, Table of n, a(n) for n = 0..250
• Index entries for linear recurrences with constant coefficients, signature (110, -1000).

Crossrefs

Cf. A007088, A007582.

Programs

Mathematica

Join[{1}, Table[10^(2n-1) + 10^(n-1), {n,1,25}]] (* or *) Join[{1}, LinearRecurrence[{110, -1000}, {11, 1010}, 25]] (* G. C. Greubel, Dec 24 2016 *)

PARI

concat([1], for(n=1,50, print1(10^(2*n-1) + 10^(n-1), ", "))) \\ G. C. Greubel, Dec 24 2016

Formula

a(n) = 10^(2n-1) + 10^(n-1) = A163664(n)/10 for n >= 1.

a(n) = A007088(A007582(n)). - Michel Marcus, Dec 24 2016

Extensions

Edited by R. J. Mathar, Aug 06 2009