19989
domain: N
Appears in sequences
- a(n) = (F(2n+1) + F(2n-1) + F(n+3) - 2)/2, where F() = Fibonacci numbers A000045.at n=10A005593
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=2, I={0,1}.at n=34A080013
- Triangle T, read by rows, such that the matrix cube shifts T one place diagonally left and upward, with T(n, 0) = T(n, n) = 1 for n>=0.at n=69A096744
- a(n) = Lucas(n) concatenated with Fibonacci(n).at n=11A247337
- Number of (1+1) X (n+1) arrays of permutations of 0..n*2+1 with each element having directed index change -1,1 0,-1 0,1 or 1,0.at n=15A264507
- Coordination sequence for (3,3,6) tiling of hyperbolic plane.at n=20A265073
- Sum of numbers of y-multisets of divisors of x for each x >= 1, y >= 0, x + y = n.at n=25A343661
- Expansion of e.g.f. (3 - 2 * exp(x))^(3/2).at n=7A375991