31756

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (odd natural numbers).at n=27A024463
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (odd natural numbers).at n=26A025083
• Number of strings of numbers x(i=1..7) in 0..n with sum i^3*x(i) equal to 343*n.at n=13A184262
• Number of (n+1) X 2 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.at n=3A206111
• Number of (n+1) X 5 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.at n=0A206114
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.at n=6A206118
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.at n=9A206118
• Numbers k such that (sigma(k) + sigma(k + sigma(k))) / k is an integer where sigma(k) = A000203(k) is the sum of the divisors of k.at n=21A383392
• Expansion of (1/x) * Series_Reversion( x / (1 + x^3 / (1 - x)^2) ).at n=15A389249