18089
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- a(n) = n*a(n-1) + (n-5)*a(n-2).at n=6A001910
- Denominators of approximations to e.at n=30A006259
- Denominators of convergents to e.at n=13A007677
- Pisot sequence T(4,6), a(n) = floor(a(n-1)^2/a(n-2)).at n=31A020747
- Pisot sequence T(6,9), a(n) = floor(a(n-1)^2/a(n-2)).at n=30A020751
- Primes that remain prime through 3 iterations of function f(x) = 8x + 7.at n=9A023294
- a(n) = Sum_{k=0..2n-2} T(n,k) * T(n,k+2), with T given by A026536.at n=6A027269
- Values of k for which there are no empty intervals when fractional_part(m*e) for m = 1, ..., k is plotted along [ 0, 1 ] subdivided into k equal regions.at n=15A036413
- Denominators of continued fraction convergents to sqrt(185).at n=10A041343
- Primes setting records for earliest alphabetical position in American English.at n=13A050444
- Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 3.at n=18A050665
- Triangular array formed from successive differences of factorial numbers, then with factorials removed.at n=60A060475
- The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to e = exp(1).at n=49A065370
- Primes expressible as the sum of (at least two) consecutive primes in at least 3 ways.at n=33A067379
- Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n).at n=49A076731
- Square array read by antidiagonals of T(n,k)=(4k-2)*T(n,k-1)+T(n,k-2) with T(n,0)=1 and T(n,1)=n.at n=22A079166
- Primes which are the denominators of convergents of the continued fraction expansion of e.at n=3A094008
- a(n) = (1/n!)*A001689(n).at n=5A094794
- Lesser prime in pair prime(k) +/- k for some k.at n=29A107636
- a(3n) = a(3n-1) + a(3n-2), a(3n+1) = 2n*a(3n) + a(3n-1), a(3n+2) = a(3n+1) + a(3n).at n=15A113874