26303

Appears in sequences

• Solution to the non-squashing boxes problem (version 1).at n=40A089054
• a(n) = n for n <= 2; for n > 2, a(n) = 2a(n-1) - a(n - floor( 1/2 + sqrt(2n) )).at n=18A096796
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (-1, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=8A150351
• a(n) = (2*n^3 + 5*n^2 - 13*n)/2.at n=28A162262
• G.f.: 1 / Product_{i>=1} (1-q^(2*i-1))^2*(1-q^(12*i-8))*(1-q^(12*i-6))*(1-q^(12*i-4))*(1-q^(12*i)).at n=28A201077