32793

Appears in sequences

• Number of partitions satisfying cn(2,5) < cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) < cn(0,5) + cn(1,5) + cn(4,5).at n=40A039873
• Expansion of (1-x)/(1-3x+x^2+4x^3-4x^4).at n=15A117353
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2*k if k <= floor(n/2) otherwise 2*(n-k), and m = 2, read by rows.at n=46A157277
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2*k if k <= floor(n/2) otherwise 2*(n-k), and m = 2, read by rows.at n=53A157277
• Numbers of the form 5^j + 8^k, for j and k >= 0.at n=37A226823
• Numbers n such that sigma(n) is a Fibonacci number.at n=26A272412
• Numbers that are the sum of a positive square and a positive fifth power in more than one way.at n=20A363715
• Numbers whose square and cube taken together contain each decimal digit at least twice.at n=24A363909
• a(n) = Sum_{k=0..floor(n/2)} binomial(k+3,4*n-8*k+3).at n=32A390040
• Numbers k such that tau(k) and sigma(k) are both Fibonacci numbers.at n=13A390231
• a(n) = Sum_{k=0..floor(3*n/8)} binomial(k+1,3*n-8*k).at n=49A392674