174960

Appears in sequences

• One third of triple factorial numbers.at n=5A034001
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*6^j.at n=25A038224
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*12^j.at n=23A038230
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*3^j.at n=23A038257
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*9^j.at n=17A038263
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*6^j.at n=18A038296
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*3^j.at n=25A038329
• Expansion of e.g.f. x*(1+x-3*x^2)/(1-3*x).at n=6A052690
• Number of transpositions (interchanges of adjacent digits, sometimes called inversions) needed to change all n-digit base 3 numbers into nondecreasing order.at n=8A069515
• a(n) = (n+1)*a(n-3), a(0)=a(1)=a(2)=1 for n>1.at n=17A081406
• a(1)=1, a(2)=2, a(3)=9; a(n) = n*(n - 2)*a(n - 1)^2/(n - 1).at n=4A112311
• a(n) = Product_{k>=0} (1 + floor(n/2^k)).at n=35A132269
• a(1) = 1; for n > 1, a(n) = 2*a(n-1) + lcm(a(n-1),n).at n=9A135507
• a(1) = 1, for n > 1: a(n) = phi(sum of the previous terms) where phi is Euler's totient function.at n=26A165931
• Totally multiplicative sequence with a(p) = 9*(p+3) for prime p.at n=29A167328
• (n-1)-st elementary symmetric function of the first n terms of the periodic sequence (1,1,1,3,1,1,1,3,...).at n=31A203235
• Triangle read by rows: T(m,n) is the Szeged index of the grid graph P_m X P_n (1 <= n <= m).at n=44A245826
• Szeged index of the grid graph P_n X P_n.at n=8A245828
• a(0) = 1; a(n+1) is the smallest number not in the sequence such that a(n+1) - Sum_{i=1..n} a(i) divides a(n+1) + Sum_{i=1..n} a(i).at n=32A250305
• Numbers such that (sum + product) of all their prime factors equals (sum + product) of all exponents in their prime factorization.at n=25A272818