1959552

Appears in sequences

• Expansion of g.f. (1+x)/(1-6*x).at n=8A003949
• Numbers of form 6^i*7^j, with i, j >= 0.at n=37A025626
• a(n) = Sum_{k=0..2n} (k+1) * A026519(n, k).at n=13A027266
• a(n) = Sum_{k=0..2n} (k+1) * A026552(n, k).at n=13A027276
• Expansion of 1/(1-6*x)^6.at n=5A036084
• a(n) = n*6^n.at n=7A036292
• Triangle read by rows: T(n,k) = binomial(n,k)*6^(n-k)*6^k, 0<=k<=n.at n=29A038260
• Triangle read by rows: T(n,k) = binomial(n,k)*6^(n-k)*6^k, 0<=k<=n.at n=34A038260
• Sums of 2 distinct powers of 6.at n=35A038478
• Triangle read by rows: T(n,k)=binomial(n,k-1)*k^(k-1)*(n+1-k)^(n-k) (1<=k<=n).at n=30A103690
• a(n) = 6^n * n*(n+1).at n=6A116164
• a(n) = binomial(2*n,n) * 6^n.at n=5A119309
• Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^9 = I.at n=8A165214
• Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^10 = I.at n=8A165782
• a(1) = 1, for n > 1: a(n) = phi(sum of the previous terms) where phi is Euler's totient function.at n=31A165931
• Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^11 = I.at n=8A166365
• Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^12 = I.at n=8A166518
• Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^13 = I.at n=8A166878
• Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^14 = I.at n=8A167108
• Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^15 = I.at n=8A167652