100349domain: NAppears in sequencesa(n) is the least integer that has exactly n anagrams that are primes.at n=35A046890Numbers k such that prime(k) == -6 (mod k).at n=2A092048Numbers k such that prime(k+1) == 2 (mod k).at n=6A105287