3306744

Appears in sequences

• Triangle of coefficients in expansion of (1+9x)^n.at n=41A013616
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.at n=39A038291
• a(n) = binomial(n-1,3)*n^(n-4).at n=8A053508
• 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=39A061356
• Number of isolated 0's in all ternary words of length n on {0,1,2}.at n=12A120926
• a(n) = (n^3 - n)*3^n.at n=7A128961
• Triangle A061356 read right to left.at n=41A139526
• Number of permutations of 8 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.at n=5A159739
• a(n) = binomial(n + 3, 3)*9^n.at n=5A173187
• Number of n X 2 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totalling two exactly once.at n=10A268633
• T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three no more than once.at n=26A269289
• Number of 6Xn 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three no more than once.at n=1A269294
• Integers equal to the least common multiple of the set of numbers generated by all the differences between their consecutive divisors, taken in increasing order.at n=25A298045
• Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 9 * T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.at n=54A317051
• Triangle read by rows: T(0,0) = 1; T(n,k) = 9*T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.at n=39A317052