59671

Properties

Appears in sequences

• Primes that remain prime through 4 iterations of function f(x) = 9x + 2.at n=26A023324
• Number of n-move bishop paths on 8x8 board from given corner to any square.at n=5A025592
• Primes with 12 as smallest positive primitive root.at n=20A061325
• Upper twin primes of upper twin prime index.at n=30A088463
• Number of partitions of a 2*n-element set with exactly two odd blocks.at n=4A096619
• Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} (or of any n-set) having k blocks of odd size (0<=k<=n).at n=57A124321
• Smallest n such that pi(n)=Floor[n/log((n-pi(n))/e)].at n=1A135325
• Numbers n of the form 4*k+3 such that 2^(m-1) == 1 (mod m) where m = (2*n-1)*n.at n=10A187923
• Primes p whose smallest positive primitive root (mod p) is not squarefree.at n=21A205581
• Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 3 array.at n=35A219349
• Prime numbersat n=6033