18389
domain: N
Appears in sequences
- a(n) = least m such that if r and s in {F(2*h)/F(2*h+1): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers).at n=5A024830
- Numbers k such that L(2*k + 1) is prime, where L(m) is a Lucas number.at n=34A117522
- Quartic product sequence: a(n) = Product_{k=1..floor((n-1)/2)} (1 + m*cos(k*Pi/n)^2 + q*cos(k*Pi/n)^4 ), with m = 2*4, q=2*4^3.at n=8A152094
- Triangle read by rows: T(n,k) = number of ways to place k nonattacking kings on an n X n board.at n=48A193580
- Number of nondecreasing -6..6 vectors of length n whose dot product with some nondecreasing -6..6 vector equals n.at n=5A226409
- T(n,k)=Number of nondecreasing -k..k vectors of length n whose dot product with some nondecreasing -k..k vector equals n.at n=60A226410
- Number of nondecreasing -n..n vectors of length 6 whose dot product with some nondecreasing -n..n vector equals 6.at n=5A226414
- Number of connected induced (non-null) subgraphs of the complete binary tree with n nodes.at n=22A286304
- a(n) is the greatest integer k such that k/Fibonacci(n) < e.at n=20A293674
- a(n) is the integer k that minimizes |e - k/Fibonacci(n)|.at n=20A293676
- The smallest position with nim-value n in subtract-a-square game.at n=41A297963
- Numbers that can be written in more than one way as p^2 + q^3 + r^4 with p, q and r primes.at n=28A318530
- Number of multisets of exactly three partitions of positive integers into distinct parts with total sum of parts equal to n.at n=24A320788
- a(n) = Sum_{d|n} mu(n/d) * binomial(d,3).at n=48A346760
- Square array A(n, k) = A048720(A065621(sigma((2n-1)^2)), sigma((2k-1)^2)), read by falling antidiagonals, (1,1), (1,2), (2,1), (1,3), (2,2), (3,1), etc.at n=50A379221