36501

Appears in sequences

• Composite numbers with four prime factors (not necessarily distinct) whose concatenation yields a palindrome.at n=15A046453
• Sum of the prime(n) primes following prime(n).at n=24A099274
• Composite numbers whose exponents in their canonical factorization lie in the geometric progression 1, 3, 9, ...at n=23A102838
• a(n) = 3*n^3.at n=23A117642
• Binomial(2n, n) - 2 mod n^4.at n=22A246134
• Number T(n,k) of binary words of length n containing exactly k (possibly overlapping) occurrences of the subword 01101; triangle T(n,k), n>=0, k=0..max(0,floor((n-2)/3)), read by rows.at n=48A277751
• Numbers k such that 3 is the largest decimal digit of k^2.at n=18A277960
• Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=12A299556
• Number of ways to choose a constant rooted partition of each part in a strict rooted partition of n.at n=35A301767
• Number of binary words of length n containing exactly one occurrence of the subword 01101.at n=12A317780
• a(0) = 1; a(n) = 2 * n * a(n-1) + Sum_{k=0..n-1} binomial(n,k) * a(k).at n=5A343672
• a(n) is the smallest number k in the sorted sequence S(q) = {k : rad(k) = q}, q = A120944(n), such that tau(k) - A008479(k) is not positive, where rad = A007947 and tau = A000005.at n=22A373737
• a(n) is the (n-1)-st frugal number in base n.at n=30A379539