A365511 - cp's OEIS frontend

A365511 Number of ways to travel from (0,0,0) to (2n,2n,2*n) with n positive integer steps in each direction, changing directions at each step.

n	a(n)
0	1
1	6
2	810
3	174000
4	46819500
5	14378702688
6	4817350825056
7	1716615248325120
8	640480159385995500
9	247630745402467284000
10	98500241916182188189536
11	40099260132768751505660160
12	16642069286080355216946537600
13	7020218653006514588616480000000
14	3002947242700351209440983200000000

[1, 6, 810, 174000, 46819500, 14378702688, 4817350825056, 1716615248325120, 640480159385995500, 247630745402467284000, 98500241916182188189536, 40099260132768751505660160, 16642069286080355216946537600, 7020218653006514588616480000000, 3002947242700351209440983200000000]

cp's OEIS Frontend

A365511 Number of ways to travel from (0,0,0) to (2n,2n,2*n) with n positive integer steps in each direction, changing directions at each step.

Table of values

List of values

cp's OEIS Frontend

A365511 Number of ways to travel from (0,0,0) to (2*n,2*n,2*n) with n positive integer steps in each direction, changing directions at each step.

Table of values

List of values

A365511 Number of ways to travel from (0,0,0) to (2n,2n,2*n) with n positive integer steps in each direction, changing directions at each step.