3151872

Appears in sequences

• a(n) = 3*2^(2*(n-1)) + 2^(n-2)*(n+1).at n=11A087438
• Number of permutations of floor(i*5/2), i=0..n-1, with all sums of 7 adjacent terms unique.at n=9A152631
• Number of permutations of floor(i*7/2), i=0..n-1, with all sums of 7 adjacent terms unique.at n=9A152635
• Number of permutations of floor(i*9/2), i=0..n-1, with all sums of 7 adjacent terms unique.at n=9A152643
• Triangular array of A(n,k) for n>=1 and 0<=k<=n^2 equal the number of permutations of the set {1,2,...,n}^2 such that first coordinates of first k elements are nondecreasing and second coordinates of the remaining n^2-k elements are nondecreasing.at n=19A261602
• Triangular array of A(n,k) for n>=1 and 0<=k<=n^2 equal the number of permutations of the set {1,2,...,n}^2 such that first coordinates of first k elements are nondecreasing and second coordinates of the remaining n^2-k elements are nondecreasing.at n=31A261602
• a(n) = n*(6*n^4 + 8*n^3 + 1 - (-1)^n)/16.at n=24A374709