login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A309850
Digits of the multiplicative inverse of A309768.
1
1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1
OFFSET
-2
FORMULA
By definition, (Sum_{i=-2..n} a(i)*2^(i+2)) * (Sum_{i=0..floor((n+2)/4)} 4^(2*i)/(2*i+1)) == 1 (mod 2^(n+3)).
EXAMPLE
arctanh(4) = ...0100000010101110111011111001111011000100, so 1/arctanh(4) = ...10110110010101001110010000000001010100.01.
PROG
(PARI) a(n) = lift(Mod(sum(i=0, (n+2)/4, 4^(2*i)/(2*i+1)), 2^(n+3))^(-1))\2^(n+2)
CROSSREFS
Sequence in context: A168553 A267636 A267841 * A262448 A068430 A141738
KEYWORD
nonn
AUTHOR
Jianing Song, Aug 20 2019
STATUS
approved