196625

Appears in sequences

• Number of walks on square lattice. Column y=4 of A052174.at n=8A005562
• Triangle read by rows: T(n, k) = binomial(2*n+1, n-k)^2*(2*k+1)/(2*n+1).at n=23A067802
• If n mod 2 = 0 then 3*2^(n-1)+n-1 else 3*2^(n-1)+n.at n=16A116969
• Triangular array of generalized Narayana numbers: T(n,k) = 5/(n+1)*binomial(n+1,k+4)*binomial(n+1,k-1).at n=40A145599
• a(n) is the number of walks from (0,0) to (0,4) that remain in the upper half-plane y >= 0 using 2*n +2 unit steps either up (U), down (D), left (L) or right (R).at n=4A145603
• Triangle read by rows: number of (1-2-3)-avoiding permutations on n letters with k peaks.at n=47A236406
• Fixed points of A153212: After a(1) = 1, numbers of the form p_i1^i1 * p_i2^(i2-i1) * p_i3^(i3-i2) * ... * p_ik^(ik-i_{k-1}), where p_i's are distinct primes present in the prime factorization of n, with i1 < i2 < i3 < ... < ik, and k = A001221(n) and ik = A061395(n).at n=55A242421
• Numbers whose square can be represented in exactly three ways as the sum of a positive square and a positive fourth power.at n=17A345968
• Array read by ascending antidiagonals: A(n, k) = (n + 1)*binomial(2*k + n - 1, k - 1)^2 / (2*k + n - 1) for k > 0, and A(n, 0) = 0.at n=50A378062