278256
domain: N
Appears in sequences
- Binomial coefficients C(n,5).at n=34A000389
- Binomial coefficient C(2n,n-12).at n=5A004318
- Binomial coefficient C(34,n).at n=5A010950
- Binomial coefficient C(n,29).at n=5A010982
- a(n) = floor(C(n,6)/7).at n=36A011797
- Number of necklaces with 7 black beads and n-7 white beads.at n=30A032192
- a(n) = n*(n+1)*(n+2)*(n+3)/4.at n=31A033487
- T(n,5), array T as in A050186; a count of aperiodic binary words.at n=29A050190
- a(n) = binomial(n, floor(n/6)).at n=34A051053
- T(n,7), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 7 black beads and n-7 white beads.at n=30A051172
- Binomial coefficients C(2*n-4,5).at n=14A053127
- Ulam numbers such that n/2 is also an Ulam number.at n=22A068799
- Second partial sums of sixth powers (A001014).at n=6A101093
- Number of subsets of {1,2,...,n} in which exactly half of the elements are less than or equal to sqrt(n).at n=34A102366
- Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k + 1, n-k), for n>=k>=0.at n=30A121335
- a(n) = binomial(2^n + 2, n).at n=5A136506
- Square array, read by antidiagonals, where T(n,k) = binomial(2^k + n-1, k).at n=41A136555
- a(n) = binomial(n^2, n)/(n+1).at n=4A177234
- Sum of binomial numbers A000332(k+3), with k in the reduced residue system modulo n.at n=30A192000
- Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=30A207363