The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A127961 A007583(n) written in binary. 6
 1, 11, 1011, 101011, 10101011, 1010101011, 101010101011, 10101010101011, 1010101010101011, 101010101010101011, 10101010101010101011, 1010101010101010101011, 101010101010101010101011, 10101010101010101010101011, 1010101010101010101010101011 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS 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}] 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 21 04:53 EST 2020. Contains 331104 sequences. (Running on oeis4.)