36736

Appears in sequences

• Number of walks on cubic lattice.at n=13A005571
• T(2n,n), array T as in A047120.at n=7A047129
• a(n) = 2^(n-4)*n*(n+1)*(n^2+5*n-2).at n=7A058649
• Product of all distinct nonzero numbers that can be formed from the digits of n.at n=27A061497
• Number of returns to the x-axis in all hill-free Dyck paths of semilength n (a Dyck path is said to be hill-free if it has no peaks at level 1).at n=10A114495
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k DUDU's starting at level 1.at n=58A135333
• Even numbers in A221715.at n=50A213218
• a(n) = q^2*(q^2+2*q-1)/2, where q = n-th prime power A000961(n).at n=10A229739
• Triangle read by rows: Catalan triangle of the k-Fibonacci sequence.at n=64A236918
• Convolution triangle of A000958(n+1).at n=56A237596
• Number of length n+6+1 0..6 arrays with every value 0..6 appearing at least once in every consecutive 6+2 elements, and new values 0..6 introduced in order.at n=10A242237
• Number of length n+3 0..2 arrays with no four elements in a row with pattern aabb (possibly a=b) and new values 0..2 introduced in 0..2 order.at n=8A242543
• T(n,k)=Number of length n+3 0..k arrays with no four elements in a row with pattern aabb (possibly a=b) and new values 0..k introduced in 0..k order.at n=53A242549
• a(n) = (n^4 + 2*n^3 - n^2)/2.at n=16A255499
• p-INVERT of (1,0,1,0,0,0,0,...), where p(S) = (1 - 2 S)^2.at n=9A291732
• a(n) = 36*n^2 - 4*n (n>=1).at n=31A304380
• Number of defective (binary) heaps on n elements where six ancestor-successor pairs do not have the correct order.at n=9A324067
• Number of defective (binary) heaps on n elements where ten ancestor-successor pairs do not have the correct order.at n=9A324071