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

Author

Artur Jasinski, Feb 09 2007

Keywords

• easy
• nonn
• less
• base

Examples

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

Links

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

Crossrefs

Cf. A007583.

Programs

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

Formula

From Colin Barker, Sep 02 2013: (Start)

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)). (End)

E.g.f.: exp(x)*(89 + 10*exp(99*x))/99. - Elmo R. Oliveira, Mar 16 2025

Extensions

Edited and extended by Stefan Steinerberger, Jun 11 2007

More terms from Colin Barker, Sep 02 2013