84672

Appears in sequences

• Number of primitive polynomials of degree n over GF(2) (version 2).at n=20A000020
• Number of primitive polynomials of degree n over GF(2).at n=20A011260
• Specific heat coefficients for square lattice spin 3 Ising model.at n=44A030122
• Theta series of lattice A_2 tensor E_7 (dimension 14, determinant 8748, minimal norm 4).at n=5A033699
• Numbers k such that the square of d(k) (number of divisors) divides k.at n=28A046754
• Duplicate of A033699.at n=5A047632
• Numbers k such that the product of the lengths of the words in the name of k in American English is equal to k.at n=2A058230
• a(n) = Product_{i=2..n} A001222(i) * Sum_{i=2..n} 1/A001222(i).at n=17A067580
• Digital sum of n = sum of palindromes from the smallest prime factor of n to the largest prime factor of n.at n=29A074310
• Numbers k such that all the following properties hold: (i) k*reverse(k) is a square; (ii) k != reverse(k); (iii) k and reverse(k) are not both squares; and (iv) k and reverse(k) have the same number of digits.at n=30A082994
• Sum of three solutions of the Diophantine equation x^2 - y^2 = z^3.at n=21A085409
• 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-pattern is equal to k.at n=39A092583
• Non-perfect powers k for which q = A051903(k)/A051904(k) is an integer, A051904(k) > 1.at n=14A093770
• Number of 3-connected planar graphs on n labeled nodes.at n=3A096330
• Numbers of the form (7^i)*(12^j), with i, j >= 0.at n=18A108238
• Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k peaks (1 <= k <= n).at n=50A114656
• Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k double rises (0 <= k <= n-1).at n=49A114687
• A triangle of q factorial type based on Stirling first polynomials: t(n,k)=If[m == 0, n!, Product[Sum[(-1)^(i + k)*StirlingS1[k - 1, i]*(m + 1)^i, {i, 0, k - 1}], {k, 1, n}]].at n=49A156588
• Triangle T(n, k) = (1/k)*binomial(n-1, k-1)*binomial(n, k-1)*2^(k-1) if floor(n/2) >= k, otherwise (1/k)*binomial(n-1, k-1)*binomial(n, k-1)*2^(n-k), read by rows.at n=50A174345
• Triangle T(n, k) = (1/k)*binomial(n-1, k-1)*binomial(n, k-1)*2^(k-1) if floor(n/2) >= k, otherwise (1/k)*binomial(n-1, k-1)*binomial(n, k-1)*2^(n-k), read by rows.at n=49A174345