16106127360
domain: N
Appears in sequences
- a(n) = n*2^(n-1).at n=30A001787
- Length of longest trail (i.e., path with all distinct edges) on the edges of an n-cube.at n=30A005985
- a(n) = n*4^n.at n=15A018215
- Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,8)-perfect numbers.at n=20A019285
- Eighth column of triangle A067402.at n=6A067408
- Determinant of the symmetric n X n matrix A defined by A[i,j] = |i-j| for 1 <= i,j <= n.at n=30A085750
- Expansion of g.f. (1-4*x+5*x^2)/(1-2*x)^2.at n=31A097067
- a(n) = 15*2^n.at n=30A110286
- Binomial transform of A004526.at n=31A139756
- a(n) is the smallest positive integer m with exactly n zeros in its binary representation and with n represented in binary as a substring of the binary representation of m.at n=29A147761
- Smallest number having exactly t divisors, where t is the n-th triprime (A014612).at n=28A185445
- Hankel transform of Thue-Morse related sequence A106400.at n=31A186026
- a(n) = 3*n*2^(3*n-1).at n=10A230539
- a(n) = 2^(n - 1) (n - mod(n, 2)).at n=29A291938
- Triangular array read by rows. T(n,k) is the number of labeled digraphs on n nodes with exactly k self loops, n>=0, 0<=k<=n.at n=23A334957
- Triangular array read by rows. T(n,k) is the number of labeled digraphs on n nodes with exactly k self loops, n>=0, 0<=k<=n.at n=25A334957
- The base-2 logarithm of this sequence equals the Q statistic value of the greedy-from-the-bottom tree with n leaves, which is the minimal Q statistic value for n.at n=19A386912