118098

Appears in sequences

• a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.at n=32A000792
• Numbers that are the sum of 6 positive 9th powers.at n=27A003395
• Numbers that are the sum of 2 nonzero 10th powers.at n=5A004802
• Numbers that are the sum of at most 2 nonzero 10th powers.at n=9A004897
• Numbers that are the sum of at most 3 nonzero 10th powers.at n=16A004898
• Numbers that are the sum of at most 4 nonzero 10th powers.at n=25A004899
• Numbers that are the sum of at most 5 nonzero 10th powers.at n=36A004900
• MU-numbers: next term is uniquely the product of 2 earlier terms.at n=35A007335
• Losing initial configurations in 2-hole Tchuka Ruma.at n=25A007780
• Pisot sequences E(2,6), L(2,6), P(2,6), T(2,6).at n=10A008776
• Numbers n such that n divides n-th Lucas number A000032(n).at n=14A016089
• a(0)=1; a(n) = 2*3^(n-1) for n >= 1.at n=11A025192
• Numbers of form 3^i*6^j, with i, j >= 0.at n=43A025614
• 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=10A027334
• Dirichlet convolution of 3^(n-1) with itself.at n=10A034751
• a(2n) = 3^n, a(2n+1) = 2*3^n.at n=21A038754
• Numbers k such that the number of divisors of k and sum of 4th powers of divisors of k are relatively prime.at n=35A046681
• a(1) = 9; a(n+1) = a(n) * sum of decimal digits of a(n).at n=4A047901
• a(1) = 3; for n > 0, a(n+1) = a(n) * sum of digits of a(n).at n=5A047912
• Sums of two powers of 9.at n=20A055260