132690

Appears in sequences

• Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 or from the line y = x-1 (i.e., E steps from the line y = x+1 to the line y = x or N steps from the line y = x-1 to the line y = x).at n=46A110107
• a(n) = Sum_{k=1..n} 2^(n mod k).at n=33A198383
• Expansion of o.g.f. A(x) = 1/F(oo,x) where F(oo,x) is the limit of the process F(n,x) = (F(n-1,x)^n - n^2*x^n)^(1/n) for n > 0, starting with F(0,x) = 1.at n=10A361768