103336

Appears in sequences

• a(n) = smallest number m which can be obtained in n ways by subtracting twice a triangular number from a perfect square.at n=10A078714
• Expansion of -2*x*(-8-12*x+9*x^2) / ( (x-1)*(3*x-1)*(3*x+1)*(1+x) ).at n=9A120468
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 1), (0, -1), (1, -1), (1, 1)}.at n=11A151437
• a(n) = (7*9^n + 1)/4.at n=5A199565
• Irregular triangle read by rows: T(n,k) is the number of regions between the free polyominoes, with n cells and width k, and their bounding boxes, n >= 1, 1 <= k <= ceiling(n/2).at n=47A380283