33864

Appears in sequences

• Number of nonisomorphic connected functions with no fixed points, or proper rings with n edges.at n=12A002862
• a(n) = floor( n*(n-1)*(n-2)*(n-3)/29 ).at n=33A011939
• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 46.at n=7A031724
• McKay-Thompson series of class 32B for the Monster group.at n=43A058630
• Numbers k such that sigma(k) = phi(prime(k)-1).at n=20A067651
• Number of n X n (0,1)-matrices with all rows distinct and all columns distinct.at n=4A088310
• a(n) = 64*n^2 + 8.at n=22A158488
• Square array T(m,n) giving the number of m X n (0,1)-matrices with pairwise distinct rows and pairwise distinct columns.at n=24A181230
• Number of ways to place n non-attacking semi-knights on an n x n chessboard.at n=4A182563
• Number of functions f:{1,2,...,n} -> {1,2,...,n} such that the 1 and the 2 are in the same component of the functional digraph representation of f.at n=6A226349
• Fundamental discriminants d uniquely characterizing all complex biquadratic fields Q(sqrt(-3),sqrt(d)) which have 3-class group of type (3,3) and second 3-class group isomorphic to SmallGroup(729,34).at n=18A250241
• Triangle read by rows: T(m,n) (1 <= n < m) is the number of moves of an (m,n)-leaper (a generalization of a chess knight) until it can no longer move, starting on a board with squares spirally numbered from 1. Each move is to the lowest-numbered unvisited square. T(m,n) = -1 if the path never terminates.at n=29A323749