39366

Appears in sequences

• a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.at n=29A000792
• Numbers that are the sum of 6 nonzero 8th powers.at n=27A003384
• Numbers that are the sum of 2 positive 9th powers.at n=5A003391
• Number of permutations of length n with spread 0.at n=8A004204
• Numbers that are the sum of at most 2 positive 9th powers.at n=9A004886
• Numbers that are the sum of at most 3 positive 9th powers.at n=16A004887
• Numbers that are the sum of at most 4 positive 9th powers.at n=25A004888
• Numbers that are the sum of at most 5 positive 9th powers.at n=36A004889
• a(n) = Product_{k=0..n-1} (2^(2^k - 1) + 1)^C(n,k).at n=3A007184
• MU-numbers: next term is uniquely the product of 2 earlier terms.at n=30A007335
• Losing initial configurations in 2-hole Tchuka Ruma.at n=23A007780
• Pisot sequences E(2,6), L(2,6), P(2,6), T(2,6).at n=9A008776
• Numbers n such that n divides n-th Lucas number A000032(n).at n=12A016089
• Numbers k such that (product of digits of k) * (sum of digits of k) = 2k.at n=5A023651
• a(0)=1; a(n) = 2*3^(n-1) for n >= 1.at n=10A025192
• Numbers of form 3^i*6^j, with i, j >= 0.at n=36A025614
• Numbers of form 6^i*9^j, with i, j >= 0.at n=19A025628
• a(n) = Sum_{k=0..2n} (k+1) * A025177(n, k).at n=8A027261
• 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=9A027334
• a(n) = 2*n^3.at n=27A033431