1240029

Appears in sequences

• Numbers that are the sum of 7 positive 11th powers.at n=35A004818
• a(n) = 7*3^n.at n=11A005032
• Triangle of coefficients in expansion of (1+9x)^n.at n=33A013616
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.at n=30A038291
• Smallest k > n such that there are exactly n pairs (x,y) (1 <= x <= y <= k) solutions of the equation: phi(xy)=sigma(x)+sigma(y).at n=43A071780
• Coefficient of the highest power of q in the expansion of nu(0)=1, nu(1)=b and for n >= 2, nu(n) = b*nu(n-1) + lambda*(n-1)_q*nu(n-2) with (b,lambda)=(2,3), where (n)_q = (1+q+...+q^(n-1)) and q is a root of unity.at n=24A072985
• 9th binomial transform of (0,0,1,0,0,0,...).at n=7A081139
• a(n) = (n+4)^n*binomial(n+2,2).at n=5A081196
• Binomial transform of Chebyshev polynomial coefficients A001793.at n=10A081278
• a(n) = (7*3^n - 4*0^n)/3.at n=12A082541
• Duplicate of A082541.at n=12A083596
• Triangle, read by rows, of coefficients for the third iteration of the hyperbinomial transform.at n=29A089463
• Expansion of (1-3*x+12*x^2)/((1-3*x)*(1+3*x)).at n=12A091103
• a(n) = (2n + 1)*3^n.at n=10A124647
• a(n) = 3*a(n-1) for n>2; a(0)=1, a(1)=3, a(2)=7.at n=13A141495
• a(n) = 3*a(n-2) for n > 2; a(1) = 1; a(2) = 7.at n=23A166481
• Triangle T(n,k) read by rows: T(n,k) is the number of unrooted hypertrees on n labeled vertices with k hyperedges, n >= 2, 1 <= k <= n-1.at n=31A210587
• a(n+2) = 3*a(n), starting 4,7.at n=23A228879
• Number of divisors of the n-th positive number that is both triangular and square.at n=39A242585
• Number of (n+2) X (1+2) 0..3 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=30A253018