199980

Appears in sequences

• McKay-Thompson series of class 6c for Monster.at n=29A007262
• Take n-th prime p, let P(p) = all primes that can be obtained by permuting the digits of p and possibly adding or omitting zeros; a(n) = |p-q| where q in P(p) is the closest to p but different from p (a(n)=0 if no such q exists).at n=9A052999
• McKay-Thompson series of class 18c for Monster.at n=29A058538
• Ordered products of the sides of primitive Pythagorean triangles.at n=14A063011
• Bemirp gaps: differences between consecutive bemirps.at n=14A333648
• a(n) is the smallest number whose divisors include exactly n that can be written in the form m + reverse(m), for some m (A067030).at n=39A358513
• Triangle read by rows: T(n,k) is the number of pairs (c,m), where c is a covering of the 1 X (2n) grid with 1 X 2 rectangles and equal numbers of red and blue 1 X 1 squares and m is a matching between red squares and blue squares, such that exactly k matched pairs are adjacent.at n=23A360441