50478

Appears in sequences

• Triangle read by rows: T(n,k) (n,k>=0) = number of peakless Motzkin paths of length n having k valleys (i.e., (1,-1) followed by (1,1)) at level zero (can be easily translated into RNA secondary structure terminology).at n=38A110333
• Number of peakless Motzkin paths of length n having no valleys (i.e., (1,-1) followed by (1,1)) at level zero (can be easily translated into RNA secondary structure terminology).at n=16A110334
• Integers having ideal digital mean up to base 5.at n=33A144800
• a(n) = 7^n-6^n-5^n-4^n-3^n-2^n-1.at n=6A147978
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=8A150770
• Magic constants of 4 X 4 magic squares which consist of consecutive primes.at n=4A173981
• a(n) = n^(n-1) - (n-1)^(n-1) - ... - 2^(n-1) - 1^(n-1).at n=6A191686
• Magic sums of 4 X 4 semimagic squares composed of consecutive primes.at n=30A270864
• Square array T(n,k) = k^n - Sum_{0 < i < k} e(i)*(k-i)^n where e(i) = 1 if the partial sum up to this term would remain <= k^n, or 0 else; n, k >= 1; read by falling antidiagonals.at n=71A332099