4193280

Appears in sequences

• Largest number of binary size n (i.e., between (n-1)-th and n-th powers of 2) with the following property: cube of its number of divisors is larger than the number itself.at n=21A056767
• Number of strings of length n over GF(4) with trace 0 and subtrace 1.at n=12A073996
• Number of strings of length n over GF(4) with trace 1 and subtrace 1.at n=12A073998
• Number of strings of length n over GF(4) with trace 1 and subtrace x where x = RootOf(z^2+z+1).at n=12A073999
• Number of monic irreducible polynomials of degree 4 in GF(2^n)[x].at n=5A115490
• Numerators of bivariate Taylor expansion of the incomplete elliptic integral of the second kind.at n=30A120362
• a(n) = 6*a(n-1) - 8*a(n-2) for n > 1; a(0) = 3, a(1) = 14.at n=10A171499
• Sum of neighbor maps: number of 2 X n binary arrays indicating the locations of corresponding elements equal to the sum mod 3 of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 2 X n array.at n=10A221667
• Trajectory of 2 under the map x -> A274940(x).at n=22A274941
• a(n) = binomial(n+1,2)*n!/n!!.at n=12A293656
• Integer areas of integer-sided triangles where the lengths of two of the sides are cubes.at n=19A329536
• Positions of records in A344590.at n=20A344588
• The number of degree-n^2 polynomials over Z/2Z that can be written as f(f(x)) where f is a polynomial.at n=22A350520
• Number of palindromic compositions of 2*n into parts <= n.at n=22A354294
• Numbers k such that A246601(k) > 2*k.at n=10A359084
• A variant of payphone permutations: given a circular booth with n payphones, a(n) is the number ways for n people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible.at n=12A361296