1835008

Appears in sequences

• a(n) = 7*4^n.at n=9A002042
• a(n) = 7*2^n.at n=18A005009
• Triangle of coefficients in expansion of (1+8x)^n.at n=41A013615
• Triangle of coefficients in expansion of (1+8x)^n.at n=34A013615
• Numbers of the form 2^k or 7*2^k.at n=39A029746
• Numbers of form 7^i*8^j with i, j >= 0, sorted.at n=34A036566
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*1^j.at n=29A038279
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*1^j.at n=39A038279
• a(n) = (n-1)*n^(n-2).at n=7A053506
• a(n) = n*8^(n-1).at n=7A053539
• First differences of 8^n (A001018).at n=7A055274
• Coefficient triangle for certain polynomials.at n=30A055858
• Essentially A053506 but with leading 0 (instead of 1) and offset 0.at n=7A055861
• a(n) = (n+1)*2^(n+4).at n=14A059165
• Triangle read by rows: T(n, k) is the number of labeled trees on n nodes with maximal node degree k (0 < k < n).at n=29A061356
• Numbers k such that k = 2*phi(k) + phi(phi(k)).at n=35A063920
• 19-almost primes (generalization of semiprimes).at n=5A069280
• Binary expansion is 1x100...0 where x = 0 or 1.at n=37A070875
• Triangular array T(n,k) read by rows, giving number of rooted trees on the vertex set {1..n+1} where k children of the root have a label smaller than the label of the root.at n=39A071207
• Where records occur in A063574.at n=15A075662