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!)
A128293 a(n) = numerator of b(n): b(1)=1; b(n+1) = b(n) + [b(1);b(2),...,b(n)], where [...] is a continued fraction of rational terms. 2

%I #10 Aug 18 2015 00:14:18

%S 1,2,7,79,4235,45300517,309689522673815,

%T 299546552508509354530034070267,

%U 17137006759160419556328886129521887629616818247406307478983

%N a(n) = numerator of b(n): b(1)=1; b(n+1) = b(n) + [b(1);b(2),...,b(n)], where [...] is a continued fraction of rational terms.

%C Next term a(10) has roughly 118 digits. - _R. J. Mathar_, Sep 24 2007

%p L2cfrac := proc(L) local a,i; a := op(-1,L) ; for i from 2 to nops(L) do a := op(-i,L)+1/a ; od: RETURN(a) ; end: A128293 := proc() local b,n,bnxt; b := [1] ; for n from 2 to 10 do bnxt := op(-1,b)+L2cfrac(b) ; b := [op(b),bnxt] ; od: [seq( numer(b[i]),i=1..nops(b))] ; end: A128293() ; # _R. J. Mathar_, Sep 24 2007

%Y Cf. A128294.

%K frac,nonn

%O 1,2

%A _Leroy Quet_, Feb 25 2007

%E Corrected and extended by _R. J. Mathar_, Sep 24 2007

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 April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)