A127961 a(n) = A007583(n) written in binary.

1, 11, 1011, 101011, 10101011, 1010101011, 101010101011, 10101010101011, 1010101010101011, 101010101010101011, 10101010101010101011, 1010101010101010101011, 101010101010101010101011, 10101010101010101010101011, 1010101010101010101010101011

Offset

0,2

Links

Table of n, a(n) for n=0..14.

Index entries for linear recurrences with constant coefficients, signature (101,-100).

Formula

a(n) = (89+10^(1+2*n))/99. a(n) = 101*a(n-1)-100*a(n-2). G.f.: -(90*x-1) / ((x-1)*(100*x-1)). - Colin Barker, Sep 02 2013

Example

A007583(2) = 11, which becomes 1011 when written in binary.

Mathematica

Table[FromDigits[IntegerDigits[(2^(2n + 1) + 1)/3, 2]], {n, 0, 14}]
LinearRecurrence[{101, -100}, {1, 11}, 20] (* Harvey P. Dale, Jul 21 2024 *)

Crossrefs

Cf. A007583.

Sequence in context: A289763 A289573 A289886 * A127962 A267606 A303786

Adjacent sequences: A127958 A127959 A127960 * A127962 A127963 A127964

Keyword

easy,nonn,less,base

Author

Artur Jasinski, Feb 09 2007

Extensions

Edited and extended by Stefan Steinerberger, Jun 11 2007

More terms from Colin Barker, Sep 02 2013

Status

approved