56576

Appears in sequences

• Number of different words that can be formed from an n X n grid of letters, reading horizontally, vertically or diagonally.at n=25A034720
• Numbers k for which there exists some m such that k = Sum_{i=1..1+floor(log_10(k))} binomial(m, d_i), where d_i is the i-th digit of k.at n=29A055481
• Period of the continued fraction for sqrt(2^n-1).at n=37A059866
• A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives s numbers.at n=16A080767
• Eighth column (m=7) of (1,3)-Pascal triangle A095660.at n=11A095663
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having height of the first peak equal to k.at n=45A108437
• Numerators of reduced forms of fractions obtained by performing the first n divisions shown below.at n=10A120031
• a(n) = 49*n^2 - 2*n.at n=33A157362
• Value of A114183 at end of n-th doubling run.at n=40A213656
• Inverse Euler transform of A122082.at n=7A318869
• Numbers whose product of prime indices is twice their sum of prime indices.at n=37A326151
• a(n) is the numerator of Product_{i=0..n-1} (n-i)^((-1)^ceiling(i/2)).at n=19A337354
• a(n) = (6*n)!/((4*n)!*n!) * (n/2)!/(3*n/2)!.at n=3A347856
• a(n) = Sum_{1 <= i, j <= n} gcd(i, j, n)^3.at n=31A368743
• a(n) = Sum_{k=0..floor(n/2)} (-1)^k * binomial(2*n-2*k-3,n-2*k).at n=11A390680