cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A220447 Define sequence x(n) by x(1)=1, thereafter x(n) = (x(n-1)+n)/(1-n*x(n-1)); sequence gives denominator(x(n)).

This page as a plain text file.
%I A220447 #15 Aug 09 2023 07:04:58
%S A220447 1,1,1,1,19,73,331,43,281,4511,10873,322921,12179,720817,538759,
%T A220447 87995911,1185403,37171235,46336951,6986985769,2602576465,
%U A220447 243540693677,181777598557,13097400661955,135996437150855,8249498995171439,56213506181241631,601615828819880125,10365435567354511181
%N A220447 Define sequence x(n) by x(1)=1, thereafter x(n) = (x(n-1)+n)/(1-n*x(n-1)); sequence gives denominator(x(n)).
%C A220447 x(n) = tan( sum_{k=1..n} arctan(k)): see A180657.
%H A220447 V. H. Moll, <a href="http://www.tulane.edu/~vhm/papers_html/xn-final.pdf">An arithmetic conjecture on a sequence of arctangent sums</a>, 2012.
%e A220447 The x(n) sequence begins 1, -3, 0, 4, -9/19, 105/73, -308/331, 36/43, -423/281, 2387/4511, -26004/10873,  ...
%p A220447 x:=proc(n) option remember;
%p A220447 if n=1 then 1 else (x(n-1)+n)/(1-n*x(n-1)); fi; end;
%p A220447 s1:=[seq(x(n),n=1..30)]; # x(n)
%p A220447 s2:=map(numer,s1); # A180657
%p A220447 s3:=map(denom,s1); # A220447
%t A220447 x[n_] := x[n] = If[n == 1, 1, (x[n-1] + n)/(1 - n*x[n-1])];
%t A220447 a[n_] := Denominator[x[n]];
%t A220447 Table[a[n], {n, 1, 29}] (* _Jean-François Alcover_, Aug 09 2023 *)
%Y A220447 For numerators see A180657.
%K A220447 nonn,frac
%O A220447 1,5
%A A220447 _N. J. A. Sloane_, Dec 22 2012