34715

Appears in sequences

• Unimodal analog of Fibonacci numbers: a(n+1) = Sum_{k=0..floor(n/2)} A071922(n-k,k).at n=18A072176
• Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=4, I={0,2}.at n=36A079974
• a(n)=the sum of the (1,2)- and (1,3)-entries and twice the (1,4)-entry of the matrix P^n + T^n, where the 4 X 4 matrices P and T are defined by P=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,0] and T=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,1].at n=34A109526
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (0, 0, 1), (1, 0, -1), (1, 1, 0)}.at n=8A150487
• a(n) = floor(n^(3/2))*floor(3+n^(3/2))/2.at n=40A185593
• Numbers n with k divisors such that n-1 and n+1 in binary representation have same number k of 0's as 1's.at n=35A191369
• G.f.: Sum_{n>=0} x^n * Sum_{k=0..n} binomial(n,k)^2 * x^k*(1-x)^(n-k).at n=18A217615
• G.f. A(x) satisfies: 1 = Sum_{n>=0} ( (1 + x*A(x))^n - A(x) )^n.at n=6A303926
• Products p*q*r of three distinct primes such that (p*q) mod r, (p*r) mod q and (q*r) mod p are all prime.at n=34A338704
• a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n,k) * binomial(3*k,k).at n=7A383118