99961

Properties

Appears in sequences

• Primes that remain prime through 4 iterations of function f(x) = 3x + 8.at n=7A023309
• Primes with 31 as smallest positive primitive root.at n=11A061735
• a(n) = largest prime using least number of possible digits with a digit sum n, or 0 if no such number exists. E.g., if n > 9 and there are no two-digit primes with a given digit sum n then three-digit numbers are explored and so on.at n=33A088115
• Expansion of (1+12*x+28*x^2+12*x^3+x^4)/(1-x)^5.at n=14A160767
• Primes containing 999 as a substring.at n=33A167292
• Number of arrays of n integers in -6..6 with sum zero and equal numbers of elements greater than zero and less than zero.at n=5A201809
• Number of arrays of 6 integers in -n..n with sum zero and equal numbers of elements greater than zero and less than zero.at n=5A201814
• The smallest of four consecutive primes with prime gaps {a,b,c} = {10,18,2}.at n=17A215719
• Centered 14-gonal (or tetradecagonal) primes.at n=26A264821
• Irregular table read by rows, T(n, k) is the rank of the k-th Genocchi permutation of {1,...,n}, permutations sorted in lexicographical order. If no Genocchi permutation of {1,...,n} exists, then T(n, 1) = 0 by convention.at n=27A347599
• Iterates of the Christmas tree pattern map (A367508), where each row is interpreted as a single binary word and converted to decimal.at n=35A368398
• Prime numbersat n=9589