25636

Appears in sequences

• (Terms in A029665)/2.at n=49A051425
• (Terms in A029643)/2.at n=45A051469
• T(2n+4,n), array T as in A055794.at n=12A055797
• Let r, s, t be three permutations of the set {1,2,3,..,n}; a(n) = value of Sum_{i=1..n} r(i)*s(i)*t(i), with r={1,2,3,..,n}; s={n,n-1,..,1} and t={n,n-2,n-4,...,1,...,n-3,n-1}.at n=23A070893
• Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=17A166776
• v(n+1)/v(n), where v=A203701.at n=2A203702
• Number of (w,x,y) with all terms in {0,...,n} and 2*|w-x| > max(w,x,y) - min(w,x,y).at n=33A213045
• Number of (2+1) X (n+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..2+1} nondecreasing.at n=12A233302
• Numbers of words on alphabet {0,1,...,7} with no subwords ii, where i is from {0,1,2,3}.at n=5A254658
• a(n) = (3 + 2*n - 3*n^2 + 4*n^3 - 3*((-1 + n) mod 2))/6.at n=33A304487
• The primitive abundant numbers k (A071395) arranged by the decreasing values of their abundancy index sigma(k)/k.at n=31A307098