277199
domain: N
Appears in sequences
- Greatest number (in decimal representation) with n nonprime substrings in base-6 representation (substrings with leading zeros are considered to be nonprime).at n=10A217116
- a(n) = the smallest multiple of prime(n) such that a(n) == j-1 (mod j) for each integer j with 1 <= j < prime(n).at n=5A234423
- a(n) is the least k such that there are exactly n numbers i with A075254(i) = k.at n=23A346378
- Numbers k such that, via a residue based measure M(k) (see Comments), k is deficient, k+1 is abundant, and abs(M(k)) + abs(M(k+1)) reaches a new maximum.at n=20A362083