33120

Appears in sequences

• Number of unlabeled Euler graphs with n nodes; number of unlabeled two-graphs with n nodes; number of unlabeled switching classes of graphs with n nodes; number of switching classes of unlabeled signed complete graphs on n nodes; number of Seidel matrices of order n.at n=9A002854
• Exponential transform of Pascal's triangle A007318.at n=37A055883
• Exponential transform of Pascal's triangle A007318.at n=43A055883
• a(n) = n*B(n), where B(n) are the Bell numbers, A000110.at n=8A070071
• Natural number transform of Aitken's triangle.at n=35A127740
• Strongly refactorable numbers: numbers n such that if n is divisible by d, it is divisible by the number of divisors of d.at n=36A141586
• Number of graphs on 2n unlabeled nodes all having odd degree.at n=4A182012
• Number of 4-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-bishop's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=27A187608
• Numbers k such that sopfr(k + omega(k)) = sopfr(k), where sopfr(i) = A001414(i) and omega(i) = A001221(i).at n=28A187878
• Numbers with prime factorization pqr^2s^5.at n=11A190293
• One more than positions of records in A249442.at n=11A249149
• Number of nX4 arrays of permutations of 4 copies of 0..n-1 with every element equal to at least one horizontal or antidiagonal neighbor and the top left element equal to 0.at n=4A267616
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal or antidiagonal neighbor and the top left element equal to 0.at n=32A267617
• Number of 2 X 2 matrices with entries in {0,1,...,n} and odd determinant with no entry repeated.at n=18A279483
• Erroneous version of A002854.at n=9A282320
• Triangle T(n,t) read by rows: the number of n X n {0,1} matrices with trace t where each row sum and each column sum is 3.at n=22A284990
• Triangle T(n,t) read by rows: the number of n X n {0,1} matrices with trace t where each row sum and each column sum is 3.at n=26A284990
• Numbers k such that (17*10^k + 43)/3 is prime.at n=20A294228
• Sum of all the parts in the partitions of n into 4 parts.at n=46A308775
• a(n) = phi(n^3 - 1)/3 where phi is A000010.at n=46A319213