37858

Appears in sequences

• a(n) = 49*n^2 - 20*n + 2.at n=27A157373
• 1/16 the number of (n+1) X 8 0..3 arrays with all 2 X 2 subblocks having the same four values.at n=12A184037
• (A122536(n)-A003000(n))/2.at n=24A218874
• Total sum of parts of multiplicity 10 in all partitions of n.at n=47A222738
• Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock equal.at n=2A237213
• Number of (n+1)X(3+1) 0..3 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock equal.at n=1A237214
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock equal.at n=7A237218
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock equal.at n=8A237218
• Number of (n+2) X (2+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=19A252378
• a(n) is the smallest number which can be represented as the sum of n distinct positive Fibonacci numbers (1 is allowed twice as a part) in exactly n ways, or -1 if no such number exists.at n=16A359391
• Number of ways to partition digits 0-9 into signed terms in decreasing absolute value order with sum n.at n=34A389952