156087

Appears in sequences

• a(n) + a(n+1) + a(n+2) = n^6, a(1)=a(2)=0.at n=9A152731
• Number of pairs of rabbits in month n in the dying rabbits problem, if they become mature after 4 months and give birth to exactly 7 pairs, one per month.at n=41A160333
• Number of (n+1)X(3+1) 0..2 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=1A236487
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=7A236490
• Number of (2+1)X(n+1) 0..2 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=2A236491
• Number of Dyck paths of semilength n such that the maximal number of peaks per level equals four.at n=9A288745
• Numbers whose sum of prime divisors equals the sum of square divisors.at n=39A390397