39556

Appears in sequences

• Triangulations of the disk G_{n,0}.at n=8A002709
• a(n) = floor(binomial(n,5)/6).at n=33A011843
• Beginning of n consecutive quadratic residues mod A025046(n).at n=24A048282
• a(n) = ceiling(binomial(n,6)/n).at n=33A053643
• a(n) = binomial(12*n-1,3*n-1)/((6*n-1)*(12*n-1)).at n=2A055579
• Number of permutations in the symmetric group S_n with order >= 3.at n=7A066052
• a(n) = floor(C(n+8,8)/C(n+2,2)).at n=25A084631
• a(n) = C(2n-1,n-1) mod n^3.at n=38A099907
• Triangle, read by rows, equal to R^4, the matrix 4th power of R = A135894.at n=41A135897
• Sums of least knight's moves from (0,0) to points in the square lattice [-n,n]x[-n,n].at n=29A183047
• a(n) = binomial(2*c-1, c-1) (mod c^3), where c is the n-th composite.at n=25A244214
• Number of length n arrays x(i), i=1..n with x(i) in 0..i and no value appearing more than 4 times.at n=6A248838
• T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in 0..i and no value appearing more than k times.at n=51A248842
• Square array T(n,m) (n>=0, m>=0) read by antidiagonals downwards giving number of rooted triangulations of type [n,m] up to orientation-preserving isomorphisms.at n=44A262586
• Even composite integers m such that U(m)^2 == 1 (mod m) and V(m) == 3 (mod m), where U(m)=A001906(m) and V(m)=A005248(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=3 and b=1, respectively.at n=13A337777
• Array read by antidiagonals: T(n,k) is the number of 3-connected triangulations of a disk up to orientation-preserving isomorphisms with n interior nodes and k nodes on the boundary, n >= 1, k >= 3.at n=35A341923
• a(n) is the number of paths to reach a position outside an 8 X 8 chessboard after n steps, starting in one of the corners, when performing a walk with unit steps on the square lattice.at n=10A376837