36891

Appears in sequences

• a(n) = T(0,n) + T(1,n-1) + ... + T(n,0), array T given by A048472.at n=11A048481
• Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having a sum of one or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=30A227161
• a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero icosahedral numbers in exactly n ways, or -1 if no such integer exists.at n=34A360215