121380
domain: N
Appears in sequences
- a(n) = f(n,n+4) where f is given in A034261.at n=7A034271
- Third column of triangle A054450 (partial row sums of unsigned Chebyshev triangle A049310).at n=23A054451
- Partial sums of A027941(n-1) with a(-1) = 0.at n=13A054452
- a(n) = Sum_{k=0..floor(n/2)} binomial(n-k+3, k).at n=22A099571
- Antidiagonal sums of triangular array T defined in A014430: T(j,k) = binomial(j+1, k) - 1 for 1 <= k <= j.at n=22A129696
- a(n) = 18522*n - 8274.at n=6A157735
- The smallest magic constant of an n X n magic square with distinct prime entries.at n=29A164843
- a(n) = Fibonacci(n+7) - Fibonacci(7).at n=19A180672
- Number of (n+2) X 3 binary arrays avoiding patterns 001 and 101 in rows and columns.at n=31A202195
- s(k)-s(j), where the pairs (k,j) are given by A205877 and A205878, and s(k) denotes the (k+1)-st Fibonacci number.at n=26A205879
- Convolution of (1,-1,2,-2,3,-3,...) and A000045 (Fibonacci numbers).at n=25A213043
- a(0) = a(1) = 1; for n>1, a(n) = a(n-1) + a(n-2) + floor(n/2).at n=23A215004
- Scaled g.f. T(u) = Sum_{n>=0} a(n)*(3*u/48)^n satisfies 3*(2*u-1)*T + d/du(4*u*(2*u-1)*(u-1)*T') = 0, and a(0)=1; sequence gives a(n).at n=4A318417