344373768
domain: N
Appears in sequences
- a(n) = 8*3^n.at n=16A005051
- a(n) = 9^n - n^8.at n=9A024109
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4. Also a(n) = sum of numbers in row n+1 of the array T defined in A026082 and a(n) = 24*3^(n-4) for n >= 4.at n=19A026097
- First differences of 9^n (A001019).at n=9A055275
- Number of endofunctions of [n] such that 1 is not a fixed point.at n=8A066274
- First differences of A003946.at n=18A080923
- a(n) = (8*3^n - 5*0^n)/3.at n=17A083583
- Number of palindromes of length n (in base 9).at n=16A117861
- Number of palindromes of length n (in base 9).at n=17A117861
- Coefficient of q^n in (1-q)^3/(1-3q); dimensions of the enveloping algebra of the derived free Lie algebra on 3 letters.at n=19A118264
- Number of isolated 0's in all ternary words of length n on {0,1,2}.at n=16A120926
- a(n) = n*9^n.at n=8A158749
- Number of permutations of 8 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.at n=7A159739
- Numbers expressible as A*B^A in two or more different ways, with A, B > 1.at n=20A171606
- a(n) = 648 * n^6.at n=9A185270
- Number of (n+1)X2 0..1 arrays with the number of clockwise edge increases in every 2X2 subblock differing from each horizontal or vertical neighbor.at n=31A205187
- T(n,k) is the number of s in {1,...,n}^n having longest ending contiguous subsequence with the same value of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=46A228273
- The smallest number with n representations of the form A*B^A with A, B > 1.at n=2A235368
- a(n) = n^9 - n^8.at n=9A240932
- a(n) = a(floor(n/2))*a(ceiling(n/2)), where a(0) = 1, a(1) = 2, a(2) = 3.at n=35A298413