43400

Appears in sequences

• Triangle T(n,k) giving number of rooted maps regardless of genus with n edges and k nodes (n >= 0, k = 1..n+1).at n=33A053979
• Number of monic irreducible polynomials over GF(5) with fixed nonzero trace.at n=8A054662
• Number of monic irreducible polynomials over GF(5) with zero trace.at n=8A054663
• Maximal number of regions into which 5-space can be divided by n hyperspheres.at n=21A059174
• Duplicate of A054663.at n=8A074026
• Triangle of Generalized Runyon numbers R_{n,k}^(4) read by rows.at n=31A173621
• Triangle read by rows: T(n,k) = 1 + (q-binomial coefficient [n,k] for q=2) - binomial(n,k).at n=47A176420
• Triangle read by rows: T(n,k) = 1 + (q-binomial coefficient [n,k] for q=2) - binomial(n,k).at n=52A176420
• Array to be read by rows: Number of ways of placing n rods of length L in a LxLxL simple cubic lattice without any two rods intersecting. (Consecutive rows are for L>=0; in each row, 0<=n<=L^2.)at n=38A185697
• Triangle of earliest friendly numbers having n friends.at n=16A211679
• a(n) = 4*(n+1)*(9*n+4).at n=34A304505
• Underline the central digit of all terms: the underlined digits reconstruct the starting sequence. This is also true if one translates the sequence in French and underlines the central letter of each word: the underlined letters spell the (French) sequence again. This is the lexicographically earliest sequence where repeated terms are admitted.at n=39A319718
• Underline the central digit of all terms: the underlined digits reconstruct the starting sequence. This is also true if one translates the sequence in French and underlines the central letter of each word: the underlined letters spell the (French) sequence again. This is the lexicographically earliest sequence of distinct terms.at n=39A319921
• Number of pairwise coprime compositions of n, where a singleton is not considered coprime unless it is (1).at n=24A337462
• Numbers whose divisors have a harmonic mean with a denominator 2.at n=24A348411
• a(n) = A003961(n) * sigma(A003961(n)), where A003961 is fully multiplicative with a(p) = nextprime(p), and sigma is the sum of divisors function.at n=44A361467
• a(n) = A249670(A003961(n)).at n=44A361468
• Square array A(n, k) = A064987(A246278(n, k)), read by falling antidiagonals; A064987(n) = n*sigma(n), applied to the prime shift array.at n=30A379499
• Square array A(n, k) = A249670(A246278(n, k)), read by falling antidiagonals; A249670(n) = A017665(n)*A017666(n), applied to the prime shift array.at n=30A379500
• Number of Hamiltonian paths in the n-Goldberg graph.at n=2A387457