55692

Appears in sequences

• a(n) = (2^n/n!)*Product_{k=0..n-1} (4*k + 5).at n=5A004985
• Coordination sequence for 4-dimensional primitive di-isohexagonal orthogonal lattice.at n=21A008530
• G.f.: 1/((1-x)*(1-x^2))^6.at n=11A038166
• Partial sums of A034263.at n=12A051947
• Triangle, read by rows, of trinomial coefficients arranged so that there are n+1 terms in row n by setting T(n,k) equal to the coefficient of z^k in (2 + 3*z + z^2)^(n-[k/2]), for n>=k>=0, where [k/2] is the integer floor of k/2.at n=50A099527
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k peaks (i.e., ud and Ud's).at n=26A108425
• Number of binary words of length n containing at least one subword 10^{6}1 and no subwords 10^{i}1 with i<6.at n=48A143286
• Number of length n left factors of Dyck paths having no base pyramids.at n=19A191789
• Places n such that the two remainders A187680(n) and A191906(n) are both zero.at n=23A192853
• Triangle read by rows giving coefficients of Genocchi q-numbers B_n(1,q) (n >= 1) expanded in powers of q.at n=65A193762
• Triangle, read by rows of 2*n+1 terms, where row n lists the coefficients in (1+3*x+2*x^2)^n.at n=58A200536
• Second elementary symmetric function of the first n terms of (2,2,3,3,4,4,5,5...).at n=32A203299
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x+289)^2 = y^2.at n=15A207059
• a(n) = a(n-1) + a(n-2) + n + 3 with n>1, a(0)=1, a(1)=2.at n=19A210729
• a(n) = 3*binomial(n+1,6).at n=12A253943
• Number T(n,k) of length 2n words such that all letters of the k-ary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting doublets into the initially empty word; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=32A256117
• Number of words of length 2n such that all letters of the quaternary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting doublets into the initially empty word.at n=3A258491
• a(n) = binomial(2*n-4,n-1)*(n+3)/n.at n=10A271823
• Expansion of 1 / ((1 - x)^7*(1 + x)^4).at n=24A299336
• Number of compositions of n avoiding the pattern (2,1,2).at n=19A335473