14880348

Appears in sequences

• Triangle of coefficients in expansion of (1+9x)^n.at n=42A013616
• a(n) = Sum_{k=0..2n} (k+1) * A025177(n, k).at n=13A027261
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*9^j.at n=34A038239
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.at n=38A038291
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*4^j.at n=29A038294
• a(n) = binomial(n-1,2)*n^(n-3).at n=8A053507
• 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=38A061356
• Growth series for fundamental group of orientable closed surface of genus 7.at n=5A063817
• 9th binomial transform of (0,0,1,0,0,0,...).at n=8A081139
• Triangle T(n,k) of numbers of connected (unicyclic) graphs with unique cycle of length k (3<=k<=n), on n labeled nodes.at n=21A098909
• a(n) = (n+1)*n^4.at n=27A101362
• Triangular array of the coefficients of the sequence of Abel polynomials A(n,x) := x*(x-n)^(n-1).at n=48A137452
• Triangle A061356 read right to left.at n=42A139526
• Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph consists of a single node or has a unique cycle of length 3.at n=54A144207
• Number of permutations of 2 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.at n=12A159715
• Numbers n such that (A000203(n)+28)/n is an integer.at n=25A162302
• Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^6 = I.at n=5A164025
• Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^7 = I.at n=5A164664
• Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^8 = I.at n=5A164970
• Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^9 = I.at n=5A165456