1062882

Appears in sequences

• a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.at n=38A000792
• Numbers that are the sum of 6 positive 11th powers.at n=27A004817
• Number of spanning trees in the graph K_{n}/e, which results from contracting an edge e in the complete graph K_{n} on n vertices (for n>=2).at n=7A007334
• Losing initial configurations in 2-hole Tchuka Ruma.at n=29A007780
• Pisot sequences E(2,6), L(2,6), P(2,6), T(2,6).at n=12A008776
• Numbers n such that n divides n-th Lucas number A000032(n).at n=20A016089
• a(0)=1; a(n) = 2*3^(n-1) for n >= 1.at n=13A025192
• a(n) = Sum_{k=0..m} (k+1) * A026148(n, m-k), where m=0 for n=1; m=n+1 for n >= 2.at n=12A027334
• Dirichlet convolution of powers of 3 (3,9,27,...) with themselves.at n=10A034719
• Dirichlet convolution of 3^(n-1) with itself.at n=12A034751
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*9^j.at n=26A038227
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*3^j.at n=22A038293
• a(2n) = 3^n, a(2n+1) = 2*3^n.at n=25A038754
• Mean integral divisors associated with A048751.at n=17A048752
• Sums of two powers of 9.at n=27A055260
• a(n) = Sum_{j=0..floor(n/3)} (-1)^j*binomial(n,3*j+1).at n=26A057682
• Triangle read by rows: T(j,k) is the number of acyclic functions from {1,...,j} to {1,...,k}. For n >= 1, a(n) = (k-j)*k^(j-1), where k is such that C(k,2) < n <= C(k+1,2) and j = (n-1) mod C(k,2). Alternatively, table T(k,j) read by antidiagonals with k >= 1, 0 <= j <= k: T(k,j) = number of acyclic-function digraphs on k vertices with j vertices of outdegree 1 and (k-j) vertices of outdegree 0; T(k,j) = (k-j)*k^(j-1).at n=43A058127
• Number of n-step walks (each step +-1 starting from 0) which are never more than 2 or less than -2.at n=25A068911
• Numbers n such that A017666(n)=phi(n).at n=21A069058
• 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=25A072985