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!)
A339390 Number of paths from (0,0,0) to (n,n,n) using steps (1,0,0), (0,1,0), (0,0,1), (1,1,1), and (2,2,2). 2

%I #38 May 30 2022 08:07:04

%S 1,7,116,2397,54845,1329644,33464881,864627351,22776683200,

%T 609024723535,16478750543705,450190397799036,12397538372467109,

%U 343712858468053319,9584085091610235280,268571959802603851989,7558772037473679862681,213548821612723752662596

%N Number of paths from (0,0,0) to (n,n,n) using steps (1,0,0), (0,1,0), (0,0,1), (1,1,1), and (2,2,2).

%C The ratio of any two consecutive terms of this sequence a(n+1)/a(n) seems to grow asymptotically to ~30 as n increases (observation).

%H Alois P. Heinz, <a href="/A339390/b339390.txt">Table of n, a(n) for n = 0..679</a>

%F From _Alois P. Heinz_, Dec 05 2020: (Start)

%F a(n) = [(x*y*z)^n] 1/(1-x-y-z-x*y*z-(x*y*z)^2).

%F a(n) = ((3*n-7)*(3*n-2)*(30*n^2-50*n+13)*a(n-1) - (3*n-2)*(3*n-5)*a(n-2) - (45*n^4-300*n^3+677*n^2-560*n+108)*a(n-3) + (3*n-2)*(3*n-11)*a(n-4) + (3*n-1)*(9*n^3-75*n^2+197*n-154)*a(n-5) + (3*n-1)*(3*n-4)*(n-4)^2*a(n-6)) / ((3*n-4)*(3*n-7)*n^2) for n>=6. (End)

%p b:= proc(l) option remember; `if`(l[3]=0, 1,

%p add((f-> `if`(f[1]<0, 0, b(f)))(sort(l-h)), h=

%p [[1, 0$2], [0, 1, 0], [0$2, 1], [1$3], [2$3]]))

%p end:

%p a:= n-> b([n$3]):

%p seq(a(n), n=0..20); # _Alois P. Heinz_, Dec 04 2020

%p # second Maple program:

%p a:= proc(n) local t; 1/(1-x-y-z-x*y*z-(x*y*z)^2);

%p for t in [x, y, z] do coeftayl(%, t=0, n) od

%p end:

%p seq(a(n), n=0..20); # _Alois P. Heinz_, Dec 05 2020

%p # third Maple program:

%p a:= proc(n) option remember; `if`(n<6, [1, 7, 116, 2397, 54845,

%p 1329644][n+1], ((3*n-7)*(3*n-2)*(30*n^2-50*n+13)*a(n-1) -(3*n-2)

%p *(3*n-5)*a(n-2) -(45*n^4-300*n^3+677*n^2-560*n+108)*a(n-3)

%p +(3*n-2)*(3*n-11)*a(n-4) +(3*n-1)*(9*n^3-75*n^2+197*n-154)*a(n-5)

%p +(3*n-1)*(3*n-4)*(n-4)^2*a(n-6)) / ((3*n-4)*(3*n-7)*n^2))

%p end:

%p seq(a(n), n=0..20); # _Alois P. Heinz_, Dec 05 2020

%t b[l_] := b[l] = If[l[[3]] == 0, 1,

%t Sum[Function[f, If[f[[1]] < 0, 0, b[f]]][Sort[l-h]], {h,

%t {{1, 0, 0}, {0, 1, 0}, {0, 0, 1}, {1, 1, 1}, {2, 2, 2}}}]];

%t a[n_] := b[{n, n, n}];

%t Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, May 30 2022, after _Alois P. Heinz_ *)

%Y Cf. A006480, A081798, A126086, A268550, A339565.

%K nonn

%O 0,2

%A _William J. Wang_, Dec 02 2020

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 24 11:49 EDT 2024. Contains 371936 sequences. (Running on oeis4.)