login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A325910 a(n) = ( (-1)^(n-1) * Sum_{k=0..n-1} (-1)^k*10^(2^k) - (1-(-1)^n)/2 )/9. 7
0, 1, 10, 1101, 11110010, 1111111100001101, 11111111111111110000000011110010, 1111111111111111111111111111111100000000000000001111111100001101 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = -a(n-1) + (10^(2^(n-1)) - 1)/9.
a(n) = A007088(A325912(n-1) - (n mod 2)) for n > 0.
EXAMPLE
1 = -0 + 1.
10 = -1 + 11.
1101 = -10 + 1111.
11110010 = -1101 + 11111111.
1111111100001101 = -11110010 + 1111111111111111.
================================================
n | (a(n))_2 | A325912(n-1)
--+------------------------------+-------------
1 | 1 = 1 | 2
2 | (10)_2 = 2 | 2
3 | (1101)_2 = 13 | 14
4 | (11110010)_2 = 242 | 242
5 | (1111111100001101)_2 = 65293 | 65294
MATHEMATICA
a[n_] := ((-1)^(n - 1) * Sum[(-1)^k * 10^(2^k), {k, 0, n - 1} ] - (1 - (-1)^n)/2)/9; Array[a, 8, 0] (* Amiram Eldar, May 07 2021 *)
PROG
(PARI) {a(n) = ((-1)^(n-1)*sum(k=0, n-1, (-1)^k*10^2^k)-(1-(-1)^n)/2)/9}
CROSSREFS
Sequence in context: A138147 A204577 A210995 * A036058 A001155 A001391
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Sep 08 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 2 18:04 EDT 2024. Contains 375616 sequences. (Running on oeis4.)