46236

Appears in sequences

• Number of connected vertex-transitive graphs with n nodes.at n=29A006800
• Least m such that m-th pandigital A050278(m) is a multiple of n or -1 if no such m exists.at n=19A071926
• Least m such that m-th pandigital A050278(m) is a multiple of n or -1 if no such m exists.at n=59A071926
• Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A127289/A127290.at n=11A127297
• Triangle T, read by rows, where row n+1 of T equals row n of matrix power T^n added to row n of T (shifted right).at n=22A130528
• Column 1 of triangle A130528.at n=5A130530
• Number of planar triangular n X n X n nonnegative integer grids symmetric under 120 degree rotation with every similarly oriented 5 X 5 X 5 subtriangle summing to 14.at n=5A154090
• Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 3Xn array.at n=10A219854
• Number of n X 3 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=6A278358
• Number of nX7 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=2A278362
• T(n,k)=Number of nXk 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=38A278363
• T(n,k)=Number of nXk 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=42A278363
• Number of triangles larger than size=1 in a matchstick-made hexagon with side length n.at n=24A307253