514080

Appears in sequences

• Triangle T(n,k) (0 <= k <= n) giving number of chains of length k in partially ordered set formed from subsets of n-set by inclusion.at n=42A038719
• Number of sets of cycle graphs of 2n nodes where the 2-colored edges alternate colors.at n=5A054479
• Number of degree-n permutations of order exactly 10.at n=9A061124
• Number of elements of S_n having order n.at n=9A074351
• Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding the 123-, the 132- and the 321-pattern is equal to k.at n=48A094067
• Triangle of a(n,m) = number of m-member minimal T_0-covers of an n-set (n >= 0, 0<= m <=n).at n=52A094544
• Magic products of 5 X 5 multiplicative magic squares.at n=13A111031
• Number of functions f:{1,2,...,n}->{1,2,...,n} such that Im(f) contains 6 fixed elements.at n=2A126781
• Triangular array T(n,k): functions f:{1,2,...,n}-> {1,2,...,n} such that each of k fixed (but arbitrary) elements are in the image of f.at n=42A174551
• a(n) is the least number such that there are n semiprimes pq such that (p+1)(q+1) = a(n) for each semiprime.at n=17A180334
• Position of records in A067513.at n=36A202727
• Numbers n such that sigma(n+sigma(n)) = 5*sigma(n).at n=15A246912
• Cayley's triangle of V numbers; triangle V(n,k), n >= 4, n <= k <= 2*n-4, read by rows.at n=50A259476
• Number of 3-cycles in the n X n rook graph.at n=35A288961
• a(n) = Pochhammer(n, 5) / 2.at n=14A293615
• Numbers k such that the continued fraction of the abundancy index of k contains a single distinct element.at n=23A349686
• Positions of records in A356018, i.e., integers whose number of evil divisors sets a new record.at n=41A356020
• Numbers m such that A357761(m) < A357761(k) for all k < m.at n=24A357764
• Triangle T(m,n) read by rows: the number of homomorphisms of the complete graph on n vertices to the quasi-complete graph on m vertices, m>=3, 3<=n<m.at n=39A360961
• Numbers k with record values of the ratio A000005(k)/A246600(k) between the total number of divisors of k and the number of divisors d of k such that the bitwise OR of k and d is equal to k.at n=26A361937