34022

Appears in sequences

• a(n) = number of refinements of the partition n^1.at n=10A213385
• Smallest m such that Fibonacci(2n-1) = m^2 + k^2.at n=26A229139
• Number of n X n 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(n+1) 0..3 array without adjacent equal elements in the latter.at n=2A229313
• Number of nX3 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X4 0..3 array without adjacent equal elements in the latter.at n=2A229316
• T(n,k)=Number of nXk 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..3 array without adjacent equal elements in the latter.at n=12A229320
• Expansion of 1/(1 - x/(1 - x^8/(1 - x^27/(1 - x^64/(1 - x^125/(1 - x^216/(1 - ... - x^(n^3)/(1 - ...)))))))), a continued fraction.at n=55A291146