22063

Properties

Appears in sequences

• Primes that remain prime through 4 iterations of function f(x) = 4x + 9.at n=9A023312
• Primes that remain prime through 5 iterations of function f(x) = 4x + 9.at n=2A023340
• Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6,6]; short d-string notation of pattern = [466].at n=30A078852
• First prime after phi(prime(n)^2).at n=34A079477
• Maximal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,...,n}.at n=39A110610
• Primes congruent to 42 mod 61.at n=39A142840
• Primes that start a run of at least seven consecutive primes, where between successive primes exactly one digit changes and the resulting digits may be permuted.at n=25A157717
• Number of nX5 0..1 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=3A232044
• T(n,k)=Number of nXk 0..1 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=31A232047
• Number of 4Xn 0..1 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=4A232050
• Primes p that can be written as phi(k) + d(k) for some k, where phi(k) = A000010(k) is Euler's totient function and d(k) = A000005(k) is the number of divisors of k.at n=28A357916
• Primes having only {0, 2, 3, 6} as digits.at n=26A386043
• Prime numbersat n=2472