41113

Properties

Appears in sequences

• Prime factors of numbers in A006521 (numbers k that divide 2^k + 1).at n=8A057719
• Primes with either no internal digits or all internal digits are 1.at n=51A069676
• Iterate function described in A085308 (= reverse concatenation of prime factors); a(n) is either 1# the fixed point[=prime] if it exists at all: 2# a(2k)=1 labels that no convergence with most even initial values, in contrary mostly rapid divergence is the case; 3# a(n)=0 if n=1 or if the iteration results in nontrivial attractor with cycle length larger than one.at n=54A085308
• Primes with digital product = 12.at n=17A107697
• Primes such that the outer 2 digits are n and n-1 and all inner digits are 1, where 0 < n < 9.at n=3A108829
• Prime factors of terms of A127263.at n=4A136372
• Primes of the form (37*10^k+17)/9.at n=1A177488
• Primes remaining prime if all but two digits are deleted.at n=48A226108
• Prime numbers containing the string 111.at n=23A243527
• Primes p such that the polynomial k^4 + k^3 + k^2 + k + p yields only primes for k = 0...5.at n=20A247949
• Primes p such that the polynomial k^4 + k^3 + k^2 + k + p yields only primes for k = 0...6.at n=8A247966
• Primes p such that the polynomial k^4 + k^3 + k^2 + k + p yields only primes for k = 0...7.at n=5A248206
• Compound filter: a(n) = P(sigma(n), sigma(2n)), where P(n,k) is sequence A000027 used as a pairing function, and sigma is the sum of divisors (A000203).at n=50A286359
• Compound filter: a(n) = P(sigma(n), sigma(2n)), where P(n,k) is sequence A000027 used as a pairing function, and sigma is the sum of divisors (A000203).at n=54A286359
• Lesser of cousin happy primes.at n=16A387896
• Prime numbersat n=4301