27701

Properties

Appears in sequences

• Largest prime preceding distinct values of lcm(1,...,m): Max{p|p < A003418(A000961(n))}. To get different LCM values, the last arguments(m) of LCM were selected from A000961.at n=8A058021
• a(n) is the largest prime < A051451(n) - 1.at n=6A058023
• a(n) = largest prime < lcm(1..n).at n=8A060358
• a(n) = largest prime < lcm(1..n).at n=9A060358
• Numbers k such that 92^k - 91^k is prime.at n=3A062658
• Number of vertically indecomposable distributive lattices on n nodes.at n=26A072361
• a(n) = Sum_{i=0..floor(n/2)} (-1)^(i+floor(n/2))*T(2i+e), where T(n) are tribonacci numbers (A000073) and e = (1/2)(1-(-1)^n).at n=19A075111
• Expansion of exp(2x)+exp(x)BesselI_0(2x).at n=11A081669
• a(n) is the smallest prime p of the form 4k+1 such that nextprime(p) - p = 4n.at n=7A082099
• prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 9.at n=24A109563
• Sum of odd-indexed terms of tribonacci numbers.at n=9A113301
• Primes p such that the decimal expansion of p remains prime under two iterations of base-10 to base-2 conversions.at n=9A123266
• Primes p such that q-p = 32, where q is the next prime after p.at n=2A126784
• Diagonal sums of Riordan array A154948.at n=17A154949
• a(n) = 38*n^2 - 1.at n=26A158596
• Primes of the form 100p + 1, where p is prime.at n=14A180469
• Primes of form a^2+b^2 such that a^4+b^4 and a^8+b^8 are primes.at n=22A182313
• Number of strings of numbers x(i=1..6) in 0..n with sum i^3*x(i)^2 equal to 216*n^2.at n=44A184307
• Primes obtained by merging 5 successive digits in the decimal expansion of sqrt(2) + sqrt(3) + sqrt(5).at n=36A241221
• Primes of the form (k^2+7)/11.at n=27A242930