708588

Appears in sequences

• a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.at n=37A000792
• Expansion of (1+x)/(1-3*x).at n=12A003946
• Numbers that are the sum of 4 positive 11th powers.at n=14A004815
• Numbers that are the sum of at most 4 positive 11th powers.at n=34A004910
• a(1)=1, a(2)=2, a(n) = 4*3^(n-3) for n >= 3.at n=13A025579
• a(n) = Sum_{k=0..m} (k+1) * A026120(n, m-k), where m=0 for n=0,1; m=n for n >= 2.at n=12A027327
• Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*9^j.at n=26A038215
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*2^j.at n=22A038292
• Number of compositions of n into 2*j-1 kinds of j's for all j>=1.at n=13A052156
• Least common multiple (LCM) of the first n+1 terms of A000792.at n=33A062723
• Least common multiple (LCM) of the first n+1 terms of A000792.at n=35A062723
• Least common multiple (LCM) of the first n+1 terms of A000792.at n=34A062723
• Number of n-step walks (each step +-1 starting from 0) which are never more than 2 or less than -2.at n=24A068911
• Numbers n such that n=phi(n)*core(n) where phi(x) is the Euler totient function and core(x) the squarefree part of x (the smallest integer such that x*core(x) is a square).at n=37A069185
• a(2n+1) = 3^n, a(2n) = 4*3^(n-1) except for a(0) = 1.at n=24A074324
• Goedel encoding of the prime factors of n, in increasing order and repeated according to multiplicity.at n=21A074736
• a(n) = 2^A066657(n) * 3^A066658(n).at n=17A076941
• a(1) = 4; a(n) = if n == 2 mod 3 then a(n-1)/2, if n == 0 mod 3 then a(n-1)*2, if n == 1 mod 3 then a(n-1)*3.at n=35A085689
• a(1) = 4; a(n) = if n == 2 mod 3 then a(n-1)/2, if n == 0 mod 3 then a(n-1)*2, if n == 1 mod 3 then a(n-1)*3.at n=33A085689
• Maximum of even products of partitions of n.at n=36A091915