108108

Appears in sequences

• Number of partitions of floor(7n/2) into n nonnegative integers each no more than 7.at n=28A001979
• a(n) = 7*(n+1)*binomial(n+5,7).at n=6A027812
• a(n) = 42*(n+1) * binomial(n+5,10).at n=3A027815
• a(n) = 7*(n+1)*binomial(n+6,7)/2.at n=7A027819
• Array read by rows: T(n,k) = binomial(n+k-2,k-1)*binomial(2*n-1,n-k).at n=30A091811
• a(n) = (2*n+n^2)*(binomial(2*n,n))/2.at n=7A119581
• Ninth column (k=8) of triangle A134832 (circular succession numbers).at n=6A135806
• Triangle read by rows: T(n,k) = binomial(n,k)*binomial(2*n-2*k,n-1), n>=1, 0<=k<=floor(n/2+1/2).at n=30A138767
• Number of strictly increasing arrangements of 7 numbers in -(n+5)..(n+5) with sum zero.at n=11A188185
• Number of nX7 0..1 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=27A201502
• Number of n-element subsets that can be chosen from {1,2,...,5*n} having element sum n*(5*n+1)/2.at n=7A204461
• Number of 7-element subsets that can be chosen from {1,2,...,14*n+7} having element sum 49*n+28.at n=2A204471
• Triangle where the g.f. for row n equals d^n/dx^n (1+x+x^2)^n / n! for n>=0, as read by rows.at n=42A220178
• Triangle read by rows: T(n,k) (n>=2, 1<=k<=n-1) is the number of unordered pairs of vertices at distances k in the odd graph O_n.at n=17A228308
• 3n concatenated with itself.at n=35A248038
• 4n concatenated with itself.at n=26A248365
• Numbers n such that n-19, n-1, n+1 and n+19 are consecutive primes.at n=8A262668
• Triangular array of generalized Narayana numbers T(n,k) = 4*binomial(n+1,k)* binomial(n-4,k-1)/(n+1) for n >= 3 and 0 <= k <= n-3, read by rows.at n=61A281297
• a(0) = 1; for n >= 1, a(n) = A059897(n, a(n-1)).at n=13A284567
• a(n) is the number of n nonintersecting arches above the x-axis that start and/or end with an arch length equal to one and have floor((n+2)/2) arches starting in odd numbered positions.at n=12A298122