32095

Appears in sequences

• Number of symmetrical planar partitions of n (planar partitions (A000219) that when regarded as 3-D objects have just one symmetry plane).at n=39A000784
• Expansion of 1/((1-x)^2*Product_{k>=1} (1-x^k)).at n=24A014153
• Numbers whose base-4 representation contains exactly four 1's and four 3's.at n=25A045133
• Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of k.at n=28A056132
• 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, 0, 1), (0, 0, -1), (1, 0, 0), (1, 1, 0)}.at n=8A150428
• Number of magic labelings with magic sum n of first graph shown in link.at n=12A244869
• Number of (n+1) X (7+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=0A250897
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=21A250898
• Number of (1+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=6A250899
• Number of unlabeled connected graphs with n edges with degree >= 3 at each node.at n=12A338604