19312

Appears in sequences

• T(n,k)=S(2n+1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=41A050161
• T(n,k)=S(2n+3,n+3,k+3), 0<=k<=n, n >= 0, array S as in A050157.at n=32A050164
• McKay-Thompson series of class 9c for the Monster group.at n=38A058095
• E.g.f.: exp(x*exp(x*exp(x)) + 1/2*x^2*exp(x*exp(x))^2).at n=6A060908
• Indices k such that 8 plus the k-th triangular number is a perfect square.at n=10A154141
• a(n) = n*(n+1)*(3*n^2+5*n+4)/12.at n=16A176060
• Number of 8-step self-avoiding walks on an n X n square summed over all starting positions.at n=5A188153
• Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 6,2,1,0,0,1,1 for x=0,1,2,3,4,5,6.at n=4A197872
• Number of (n+1)X(4+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw.at n=4A253322
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw.at n=32A253326
• Number of (5+1)X(n+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw.at n=3A253330
• Number T(n,k) of ordered pairs (p,q) of permutations of [n] with equal up-down signatures and p(1)=q(1)=k if n>0; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=30A262372
• Number T(n,k) of ordered pairs (p,q) of permutations of [n] with equal up-down signatures and p(1)=q(1)=k if n>0; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=34A262372
• Number of ordered pairs (p,q) of permutations of [n] with equal up-down signatures and p(1)=q(1)=2.at n=5A262479
• Numbers which are representable as a sum of seventeen but no fewer consecutive nonnegative integers.at n=26A270302
• Expansion of 1/((1 - x)^8 + x^8).at n=10A306941
• Number of multimin partitions of integer partitions of n.at n=11A317546
• Number of ordered pairs (p,q) of permutations of [n] with equal up-down signatures and p(1)=q(1)=6.at n=1A321062
• Sum of the fifth largest parts of the partitions of n into 10 parts.at n=43A326594
• Irregular table read by rows: Take an octagon with all diagonals drawn, as in A333075. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.at n=34A333076