76545

Appears in sequences

• Expansion of e.g.f. theta_3^(1/2).at n=9A015664
• n written in fractional base 8/7.at n=37A024649
• a(n) is the n-th sextic factorial number divided by 3.at n=4A034723
• Number of labeled triangular cacti with 2n+1 nodes (n triangles).at n=4A034941
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.at n=31A038221
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.at n=32A038221
• Odd numbers divisible by exactly 9 primes (counted with multiplicity).at n=5A046322
• Number of permutations sigma of [2n] without fixed points such that sigma^4 = Id.at n=5A052503
• Product of nonzero digits of A066553(n).at n=13A066584
• Expansion of (1-x)^(-1)/(1-2*x^2+2*x^3).at n=22A077881
• a(1) = 1, a(n+1) is the smallest odd multiple of a(n) (other than a(n) itself) in which the digits are alternately even and odd.at n=7A078226
• Riordan array (1, 3+3x).at n=62A099093
• Number of divisors of 240^n.at n=26A103532
• Number of 3 X 3 symmetric matrices over Z(n) having determinant 0.at n=8A115223
• Numbers with exactly 3 distinct odd prime divisors {3,5,7}.at n=33A147576
• Riordan array [exp(x^2/2+x^4/4),x].at n=55A152150
• The odd part of Minkowski(n)/n!at n=26A163394
• Triangle T(n, k) = (n-k)^n * binomial(n, n-k) for n < 2*k, k^n * binomial(n, k) for n >= 2*k with T(n, 0) = T(n, n) = 1, read by rows.at n=31A167040
• Triangle T(n, k) = (n-k)^n * binomial(n, n-k) for n < 2*k, k^n * binomial(n, k) for n >= 2*k with T(n, 0) = T(n, n) = 1, read by rows.at n=32A167040
• (n-1)-st elementary symmetric function of the first n terms of A010684.at n=16A203230