The number of different lattice paths from (0,0) to (2n,0) using steps of S={(i,i) or (i,-i): i=1,2,...,n} with j flaws(j=1,2,...,n-1), where the j flaws is the sum of lengths of down steps below the x-axis. (For down steps that are partly above and partly below the x-axis we just count the part below the x-axis.) This number is independent of the number of flaws.
A210474
The number of different lattice paths from (0,0) to (2n,0) using steps of S={(i,i) or (i,-i): i=1,2,...,n} with j flaws(j=1,2,...,n-1), where the j flaws is the sum of lengths of down steps below the x-axis. (For down steps that are partly above and partly below the x-axis we just count the part below the x-axis.) This number is independent of the number of flaws.
Terms
- a(0) =1a(1) =0a(2) =4a(3) =24a(4) =156a(5) =1072a(6) =7668a(7) =56520a(8) =426380a(9) =3276384a(10) =25556196a(11) =201828728a(12) =1610647932a(13) =12968268432a(14) =105219588308a(15) =859440482856
External references
- oeis: A210474