3758096384

Appears in sequences

• a(n) = n*2^(n-1).at n=28A001787
• a(n) = 7*2^n.at n=29A005009
• Length of longest trail (i.e., path with all distinct edges) on the edges of an n-cube.at n=28A005985
• a(n) = n*4^n.at n=14A018215
• Coordination sequence for diamond structure D^+_28. (Edges defined by l_1 norm = 1.)at n=15A035890
• Triangle T(n,k) = C_n(k) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1<=k<=n).at n=34A058843
• Determinant of the symmetric n X n matrix A defined by A[i,j] = |i-j| for 1 <= i,j <= n.at n=28A085750
• Start with the sequence [1, 1/2, 1/3, ..., 1/n]; form new sequence of n-1 terms by taking averages of successive terms; repeat until reach a single number F(n); a(n) = denominator of F(n).at n=27A090634
• Total number of edges in all labeled graphs on n nodes.at n=7A095351
• Expansion of g.f. (1-4*x+5*x^2)/(1-2*x)^2.at n=29A097067
• 2^(n-1) times coefficient of x in (1+x)^n mod U(n,x), U the Chebyshev polynomials.at n=27A099590
• Triangle T, read by rows, where matrix power T^4 has powers of 4 in the secondary diagonal: [T^4](n+1,n) = 4^(n+1), with all 1's in the main diagonal and zeros elsewhere.at n=32A117254
• Column 0 of triangle A118441, which is the matrix log of triangle A118435.at n=28A118442
• Row sums of A125175.at n=31A125176
• Binomial transform of [1, 6, 1, 6, 1, 6, ...].at n=30A135092
• Binomial transform of A004526.at n=29A139756
• Number of (possibly overlapping) occurrences of the subword given by the binary expansion of n in all binary words of length n.at n=33A228612
• Numerators of the terms of Lehmer's series S_2(2), where S_k(x) = Sum_{n>=1} n^k*x^n/binomial(2*n, n).at n=27A259852
• Sum of the degrees of asymmetry of all binary words of length n.at n=29A274497
• Triangle read by rows: T(n,k) is the number of independent sets of size k over all simple labeled graphs on n nodes, n>=0, 0<=k<=n.at n=38A277219