236196

Appears in sequences

• a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.at n=34A000792
• Expansion of (1+x)/(1-3*x).at n=11A003946
• Numbers that are the sum of 4 nonzero 10th powers.at n=14A004804
• Numbers that are the sum of at most 4 nonzero 10th powers.at n=34A004899
• a(1)=1, a(2)=2, a(n) = 4*3^(n-3) for n >= 3.at n=12A025579
• Numbers of the form 4^i * 9^j, with i, j >= 0.at n=32A025620
• Numbers of form 6^i*9^j, with i, j >= 0.at n=25A025628
• 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=11A027327
• Number of compositions of n into 2*j-1 kinds of j's for all j>=1.at n=12A052156
• Periodic part of continued fraction for sqrt(n), encoded by raising successive primes to the terms. If sqrt(n)=c0+[c1,c2,c3...] then a(n)=2^c1*3^c2*5^c3*...at n=29A059903
• Least common multiple (LCM) of the first n+1 terms of A000792.at n=30A062723
• Least common multiple (LCM) of the first n+1 terms of A000792.at n=32A062723
• Least common multiple (LCM) of the first n+1 terms of A000792.at n=31A062723
• Square of determinant of character table of the dihedral group with 2n elements.at n=8A063073
• Squares k which are divisible by phi(k).at n=27A063755
• Number of ternary trees (A001764) with n nodes and maximal diameter.at n=10A064017
• Number of n-step walks (each step +-1 starting from 0) which are never more than 2 or less than -2.at n=22A068911
• Treated as strings, the concatenation c of the prime factors of n, in increasing order, is an initial segment of n. Equivalently, n begins with c.at n=13A069154
• a(2n+1) = 3^n, a(2n) = 4*3^(n-1) except for a(0) = 1.at n=22A074324
• Increasing gaps between 3-smooth numbers (upper end).at n=38A084790