459270

Appears in sequences

• Triangle of coefficients in expansion of (1+9x)^n.at n=40A013616
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.at n=40A038221
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.at n=40A038291
• a(n) = binomial(n-1,4)*n^(n-5).at n=8A053509
• 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=40A061356
• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k leaves (i.e., vertices of degree 0; n>=0, k>=1). A ternary tree is a rooted tree in which each vertex has at most three children and each child of a vertex is designated as its left or middle or right child.at n=33A120429
• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k vertices of outdegree 2 (n >= 0, k >= 0).at n=34A120982
• Triangular array of the coefficients of the sequence of Abel polynomials A(n,x) := x*(x-n)^(n-1).at n=50A137452
• Triangle A061356 read right to left.at n=40A139526
• a(n) = binomial(n + 4, 4)*9^n.at n=4A173000
• Triangle read by rows, T(n,k) = k^n*A056040(n), n>=0, 0<=k<=n.at n=39A195009
• 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=46A317051
• Unitary weird numbers (A064114) that are divisible by 3.at n=3A326808
• Unitary weird numbers (A064114) that are not weird numbers (A006037).at n=24A328562
• Infinitary weird numbers (A306984) whose number of divisors is not a power of 2.at n=22A335936