40054

Appears in sequences

• Numbers where the difference of consecutive fifth powers is "close" to another fifth power: let m = k^5 - (k-1)^5; sequence lists the numbers k where m - floor(m^(1/5))^5 < floor(sqrt(k))^5.at n=8A053804
• Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 (i.e., E steps from the line y=x+1 to the line y = x).at n=39A110098
• L.g.f.: Sum_{n>=1} x^n/n * Product_{d|n} (1 + d*x^n)^d.at n=38A205483
• Number of length n+5 0..6 arrays with every six consecutive terms having the maximum of some two terms equal to the minimum of the remaining four terms.at n=0A250079
• T(n,k)=Number of length n+5 0..k arrays with every six consecutive terms having the maximum of some two terms equal to the minimum of the remaining four terms.at n=15A250081
• Number of length 1+5 0..n arrays with every six consecutive terms having the maximum of some two terms equal to the minimum of the remaining four terms.at n=5A250082
• Binomial transform of the continued fraction expansion of e.at n=14A306809