64698

Appears in sequences

• Triangle read by rows: let T(n,k) (for n >= 0, 0 <= k <= n) be the number of walks from (0,0) to (n,k) using steps (1,1), (1,0), (1,-1) and (0,-1); n-th row of triangle gives T(n,n), T(n,n-1), ..., T(n,0).at n=51A223092
• Numbers n = concat(s,t) such that n = prime(s) + prime(t).at n=7A251860