20358

Appears in sequences

• a(n) = floor( n*(n-1)*(n-2)*(n-3)/28 ).at n=29A011938
• Triangle T(n,k), read by rows, formed by setting all entries in the zeroth column ((n,0) entries) and the main diagonal ((n,n) entries) to powers of 2 with all other entries formed by the recursion T(n,k) = T(n-1,k) + T(n,k-1).at n=51A096466
• Number of (n+1) X 5 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors.at n=14A206263
• Numbers whose arithmetic derivatives are a permutation of their digits.at n=30A225902
• Number of length n 0..5 arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=5A244900
• T(n,k)=Number of length n 0..k arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=50A244903
• Number of length 6 0..n arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=4A244909
• Numbers whose Euler totient function is equal to the product of the number of divisors of their k first powers, for some k.at n=40A283759
• a(n) = n*(n+1)*(n+3).at n=26A317637