44649
domain: N
Appears in sequences
- 9 times octagonal numbers: a(n) = 9*n*(3*n-2).at n=41A064201
- 5-almost primes with semiprime digits (digits 4, 6, 9 only).at n=12A111697
- a(n) is the least K such that K*6*M(n) - 1 and K*6*M(n) + 1 are twin primes, where M(n) = n-th Mersenne prime.at n=13A126612
- a(n) = NumberOfPartitions(n) * ( tau(n)-1 ).at n=34A141670
- Triangle read by rows: T(n,k) (n >= 1, k >= 0) = number of Dyck paths of semilength k avoiding the pattern U^n D^n.at n=60A238094
- a(n) = 3*p(n), where p(n) is the number of partitions of n.at n=35A299473