31465
domain: N
Appears in sequences
- Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=31A000332
- Number of intersections of diagonals in the interior of a regular n-gon.at n=30A006561
- Binomial coefficient C(31,n).at n=4A010947
- Binomial coefficient C(31,n).at n=27A010947
- a(n) = binomial(n,27).at n=4A010980
- Pisot sequence E(9,19), a(n)=[ a(n-1)^2/a(n-2)+1/2 ].at n=11A014005
- T(n,4), array T as in A050186; a count of aperiodic binary words.at n=27A050189
- Binomial coefficients binomial(2*n-3,4).at n=13A053126
- a(n) = Product_{k|n} (n+1-k).at n=34A056819
- a(n) = binomial(n,floor(n/7)).at n=31A062947
- a(n) = lcm(n, n+1, n+2, n+3)/12.at n=27A067047
- Number of solenoidal flows (flow in = flow out) in a 3 X 3 square array with integer velocities -n .. n.at n=8A068722
- Number of solenoidal flows (flow in = flow out) in an n X n square array with integer velocities in -8 .. 8.at n=2A068733
- Multiplicative closure of twin prime pair products (A037074).at n=26A074480
- First differences of A048093.at n=30A084919
- Number of connected ordered 5-element T_0-antichains on an unlabeled n-set.at n=27A092608
- Triangle of triangular binomial coefficients, read by rows, where column k has the g.f.: 1/(1-x)^((k+1)*(k+2)/2) for k >= 0.at n=61A098568
- Sum{k>=0, C(2^k-1,n-2*(2^k-1))}.at n=66A119969
- Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k - 1, n-k), for n>=k>=0.at n=31A122178
- Number of base 17 circular n-digit numbers with adjacent digits differing by 8 or less.at n=4A125452