120776
domain: N
Appears in sequences
- Triangular array read by rows: for n, k >= 1, a(n+1, 1) = 2*a(n, n); a(n+1, k+1) = a(n, k)+a(n+1, k).at n=38A129340
- Triangle read by rows: T(n,w) is the number of n-step self avoiding walks on a 3D cubic lattice confined between two infinite planes a distance w apart where the walk starts on one of the planes.at n=29A338126
- E.g.f. satisfies A(x) = 1 - log(1 - x*A(x)^3)/A(x)^2.at n=6A365546