30760

Appears in sequences

• Number of n-step self-avoiding walks on cubic lattice ending at point with x=3.at n=5A000762
• Number of 2n-bead balanced binary necklaces which are not equivalent to their reverse, complement or reversed complement.at n=11A045675
• Number of 2n-bead balanced binary necklaces of fundamental period 2n which are inequivalent to their reverse, complement and reversed complement.at n=11A045684
• Triangle read by rows: T(n,k) is the number of hill-free Schroeder paths of length 2n that have k returns to the x-axis (0<=k<=floor(n/2)). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A hill is a peak at height 1.at n=27A114692
• 0-sequence of reduction of hexagonal numbers sequence by x^2 -> x+1.at n=11A192143
• The number of primes of the form i^2 + j^4 (A028916) <= 2^n, counted with multiplicity.at n=24A226496
• Number of n-step self-avoiding walks on cubic lattice ending at point with x = k.at n=39A227338
• Number of nX4 0..1 arrays with every element unequal to 1, 2, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=12A305093
• Expansion of Product_{k>=1} 1/(1 - k*x^k/(1 - x)^k).at n=10A307261
• Number of multisets of exactly two partitions of positive integers into distinct parts with total sum of parts equal to n.at n=35A320787
• Number of 3 X n integer matrices (m_{i,j}) such that m_{1,1}=0, m_{3,n}=2, and all rows, columns, and falling diagonals are (weakly) monotonic without jumps of 2.at n=13A323967