22010

Appears in sequences

• In the list of divisors of n (in base 3), each digit 0-2 appears equally often.at n=15A045811
• A064637 converted to factorial base.at n=18A064477
• Smallest multiple of n with digit sum = 5, or 0 if no such number exists, e.g. a(3k) = a(11k) = 0.at n=61A069524
• Smallest k such that k*Mersenne_prime(n)^2 -1 (or k*A000668(n)^2 -1) is prime.at n=20A098818
• Terms in A112039 that are divisible by 3, divided by 3.at n=35A112040
• Expansion of (1 - 2*x^2)/(1 + x)^5. Fourth column of Riordan triangle A248156.at n=29A248160
• a(n) is the number of odd numbers k in range [2^n, (2^(n+1))-1] such that all terms in finite sequence [k, floor(k/2), floor(k/4), floor(k/8), ..., 1] are squarefree.at n=34A293441
• Numbers k such that k and k+1 are the product of exactly four distinct primes.at n=16A318896
• Numbers k such that k and k+1 each have at least 4 distinct prime factors.at n=34A321504
• Number of integer partitions of n whose LCM is a multiple of n.at n=57A327778
• a(n) is the number of regions formed by n-secting the angles of a decagon.at n=33A335800
• Numbers m such that d(1)^1 + d(2)^2 + ... + d(p)^k = d(1)! + d(2)! + ... + d(k)!, where d(i), i=1..k, are the digits of m.at n=35A342945