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!)
A052133 CONTINUANT transform of 0, 1, 1, 2, 1, 3, 2, 3, ... (A002487). 1

%I #12 Nov 25 2014 05:21:19

%S 0,1,1,3,4,15,34,117,151,721,2314,12291,26896,146771,467209,2015607,

%T 2482816,14429687,60201564,435840635,1367723469,11377628387,

%U 58255865404,419168686215,896593237834,6695321351053,34373199993099,281680921295845,879415963880634

%N CONTINUANT transform of 0, 1, 1, 2, 1, 3, 2, 3, ... (A002487).

%H Alois P. Heinz, <a href="/A052133/b052133.txt">Table of n, a(n) for n = 0..400</a>

%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>

%p b:= proc(n) option remember; `if`(n<2, n,

%p `if`(irem(n, 2, 'r')=0, b(r), b(r) + b(r+1)))

%p end:

%p a:= proc(n) option remember; `if`(n<-1, 0,

%p `if`(n<0, 1, b(n)*a(n-1)+a(n-2)))

%p end:

%p seq(a(n), n=0..35); # _Alois P. Heinz_, Aug 06 2013

%t b[n_] := b[n] = If[n < 2, n, {q, r} = QuotientRemainder[n, 2]; If[r == 0, b[q], b[q] + b[q+1]]]; a[n_] := a[n] = If[n < -1, 0, If[n < 0, 1, b[n]*a[n-1] + a[n-2]]]; Table[a[n], {n, 0, 35}] (* _Jean-François Alcover_, Nov 25 2014, after _Alois P. Heinz_ *)

%Y Cf. A071898.

%K nonn

%O 0,4

%A _N. J. A. Sloane_, Jul 18 2002

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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)