48618

Appears in sequences

• a(n) is both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers.at n=36A059270
• a(n) = 18*(n - 2)*(2*n - 5).at n=37A060787
• Number of different ways to select n elements from two sets of n elements under the precondition of choosing at least one element from each set.at n=8A115112
• A115112 with initial term changed from 0 to 1.at n=8A171074
• a(n) = (7*n+2)*(7*n+5) = 49*n^2 + 49*n + 10.at n=31A177060
• Numbers n such that n is the mean value of phi(n) and reversal(n).at n=5A178326
• a(n) = binomial(n, [n/2]) - 2.at n=18A201686
• Ordered differences of central binomial coefficients.at n=37A205008
• s(k)-s(j), where (s(k),s(j)) is the least pair of central binomial coefficients for which n divides their difference.at n=36A205014
• Number of meanders of order n without 1-1 cuts.at n=7A208358
• Sum of successive absolute differences of the binomial coefficients = 2*A014495(n).at n=17A218008
• Number of permutations of [n] having a shortest ascending run of length 8.at n=9A228675
• Triangle T(n,m) for the number of ways to put n stones into an m X n square grid such that each of the m rows contains at least one stone.at n=37A259051
• a(n) = n*(2*n + 1)*(4*n + 1).at n=18A316224
• Irregular triangle read by rows: T(n,d) (n >= 1, d <= n-1 for n>1) = number of n X n integer-valued matrices M such that M_{1,1}=0, M_{n,n}=d, M_{(i+1),j} = M_{i,j} + (0 or 1), M_{i,(j+1)} = M_{i,j} + (0 or 1), and M_{(i+1),(j+1)} = M_{i,j} + (0 or 1).at n=29A323848