26006

Appears in sequences

• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A000201 (lower Wythoff sequence).at n=27A024464
• 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 = A000201 (lower Wythoff sequence).at n=26A025084
• Sum of the lengths of the cycle types of the permutation created by length sorting on the partitions of n.at n=37A036056
• Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,1.at n=7A037537
• E.g.f.: exp(x+x^2/2!+x^3/3!)/(1-x).at n=7A130908
• Number of n X n arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X n array.at n=4A219588
• Number of nX5 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nX5 array.at n=4A219592
• T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nXk array.at n=40A219595
• Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 5Xn array.at n=4A219598
• Number of 4Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself.at n=19A265994
• a(n) = Sum_{k=1..n} (binomial(n, k) * 2^k) (mod 3^k).at n=10A386661