36193

Appears in sequences

• Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+2x+3y>1.at n=21A211622
• Number of -4..4 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having one, two or three distinct values for every i<=n and j<=n.at n=7A211690
• Number of (n+1) X (3+1) arrays of permutations of 0..n*4+3 with each element having directed index change 0,0 1,1 0,-1 -1,1 or 0,-2.at n=4A264239
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 1,1 0,-1 -1,1 or 0,-2.at n=25A264244
• Number of (5+1)X(n+1) arrays of permutations of 0..n*6+5 with each element having directed index change 0,0 1,1 0,-1 -1,1 or 0,-2.at n=2A264249
• On a spirally numbered square grid, with labels starting at 1, this is the number of the last cell that an (n,n+1) leaper reaches before getting trapped, or -1 if it never gets trapped.at n=25A343179
• Numerators of the partial sums of 1/d(prime(k)+1), where d is the number of divisors function.at n=46A386921
• a(n) = Sum_{k=0..floor(2*n/5)} binomial(k+2,2) * binomial(k,2*n-5*k).at n=30A392270
• a(n) = Sum_{k=0..floor(3*n/5)} binomial(k+2,2) * binomial(k,3*n-5*k).at n=20A392314