12845056

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*7^j.at n=29A038285
• a(0)=1, a(1)=6, a(n)=49*8^(n-2) if n>=2.at n=8A055847
• a(n) = (n-1)^2 * n^(n-2).at n=7A076728
• a(n) = -2*a(n-1) + 4*a(n-3), with a(0) = 1, a(1) = a(2) = 0.at n=27A099212
• Number of subsets of {1,2,...,n} which contain no three consecutive odd numbers.at n=24A127195
• Main transitions in systems of n particles with spin 7/2.at n=6A212702
• Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 1 as Sum_{k=0..n} T(n,k)*binomial(n,k).at n=52A244118
• Number T(n,k) of endofunctions f on [n] that are self-inverse on [k] but not on [k+1]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=36A245692
• If n = 10k+m (0 <= m <= 9) then a(n) = n*k^m.at n=48A256556
• Numbers of the form i^j * j^k * k^i, where i,j,k > 1.at n=35A259406
• a(n) = A257851(n,n).at n=18A264959
• a(n) is the smallest number which can be represented as the sum of n n-almost primes in exactly n ways, or -1 if no such number exists.at n=18A365493
• Total number of ones in runs of 1's of length >= 4 over all binary strings of length n.at n=22A386250