80587

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 = (F(2), F(3), ...), t = (primes).at n=26A024597
• a(n) = 74*n^2 + 1.at n=33A158742
• Number of n X 6 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 3.at n=33A239359
• Sum of first n Honaker primes.at n=32A276255
• a(n) is the number of ways to place n indistinguishable balls into n distinguishable boxes with at least 4 boxes remaining empty.at n=9A370197