43600
domain: N
Appears in sequences
- Number of partitions of 1/n into 4 reciprocals of positive integers.at n=31A020327
- Square table T, read by antidiagonals, where T(n,k) gives the number of n-th generation descendents of a node labeled (k) in the tree of 5-tournament sequences.at n=23A113103
- Triangle T, read by rows, equal to the matrix square of triangle A113106, which satisfies the recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k).at n=10A113108
- Number of 5-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 2 and t_i = 2 (mod 4) and t_{i+1} <= 5*t_i for 1<i<n.at n=4A113109
- a(n) = 109*n^2.at n=20A174339
- Irregular table whose rows are the nontrivial cycles of the ghost iteration A329200, ordered by increasing smallest member, always listed first.at n=5A329196