2657205
domain: N
Appears in sequences
- a(n) = 5*3^n.at n=12A005030
- a(n) = n*3^(n-4).at n=12A006234
- Least number with exactly n odd divisors.at n=25A038547
- Smallest lucky number that is the product of n lucky numbers.at n=11A064703
- Triangle with columns built from certain power sequences.at n=47A067402
- Third column of triangle A067402.at n=7A067403
- Triangle with columns built from certain power sequences.at n=47A067417
- a(n) = a(n-1) + a(n-2) + gcd(a(n-1), a(n-2)) for n > 1; a(0)=1, a(1)=1.at n=27A083658
- a(0)=1, a(1)=5, a(n) = -3*a(n-1), n>1.at n=13A084244
- Maximum of odd products of partitions of n.at n=41A091916
- The least number k such that there are n different representations of k as the difference of two positive triangular numbers.at n=26A136108
- a(n) is the smallest positive integer that is coprime to n and has n divisors.at n=25A136641
- a(n) = 3*a(n-2) for n > 2; a(1) = 5, a(2) = 3.at n=24A162813
- a(n) = 3*a(n-2) for n > 2; a(1) = 1, a(2) = 5.at n=25A166465
- a(n) = n^6*(n + 1)/2.at n=9A168526
- G.f.: (1+x+x^2+2*x^5-2*x^10)/(1-3*x^3).at n=41A213933
- a(n) = 5*n^4.at n=27A269792
- Number of subsets of {1, 2, ..., n} such that the sum of the reciprocals is strictly less than 1.at n=25A305442
- 1-parking triangle T(r, i, 1) read by rows: T(r, i, k) = (r + 1)^(i-1)*binomial(k*(r + 1) + r - i - 1, r - i) with k = 1 and 0 <= i <= r.at n=42A329057
- a(n) is the least positive number k such that 3^n+k has n prime factors counted with multiplicity.at n=22A337219