80196
domain: N
Appears in sequences
- Denominators of continued fraction convergents to sqrt(569).at n=11A042091
- Solution to the Dancing School Problem with 8 girls and n+8 boys: f(8,n).at n=5A079913
- Solution to the Dancing School Problem with n girls and n+5 boys: f(n,5).at n=7A079924
- Number of simple unlabeled graphs on n nodes with exactly 8 connected components that are trees or cycles.at n=15A215988
- Number of n X 3 binary arrays with rows and columns lexicographically nondecreasing and column sums nonincreasing.at n=18A266465
- Let v = list of denominators of Farey series of order n (see A006843); a(n) = sum of products of adjacent terms of v.at n=27A278046
- Number of permutations s_1,s_2,...,s_n of 1,2,...,n such that for all j=1,2,...,n, Sum_{i=1..j} s_i divides Sum_{i=1..j} s_i^3.at n=14A291445
- Number of permutations s_1,s_2,...,s_n of 1,2,...,n with s_n = n (if n>0) and such that for all j=1,2,...,n, Sum_{i=1..j} s_i divides Sum_{i=1..j} s_i^3.at n=16A291518
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=5A316810
- Number of nX6 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=2A316813
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=30A316815
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=33A316815