244464

Appears in sequences

• Let n be a positive integer, n>3. Define a tournament on the vertex set {2,3,..,n} by: for i < j, i is adjacent to j if i divides j, else j is adjacent to i. If T(n) denotes its adjacency matrix, then the above sequence is det(T(n))for n=4,5,6....42.at n=26A057980
• Number of (w,x,y,z) with all terms in {0,...,n} and max{w,x,y,z}>2*min{w,x,y,z}.at n=22A212743
• Number of length n+2 0..4 arrays with no pair in any consecutive three terms totalling exactly 4.at n=7A245991