11168

Properties

Appears in sequences

• Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=52A036816
• Number of Greek-key tours on a 3 X n board; i.e., self-avoiding walks on a 3 X n grid starting in the top left corner.at n=12A046994
• Number of subsets of integers 1 through n (including the empty set) containing no pair of integers that share a common factor.at n=25A084422
• Total number of elements in all subsets of {1,2,..,n} with relatively prime elements.at n=10A085948
• Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_{k+1}, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists.at n=15A110735
• Let r_1 = 1. Let r_{m+1} = r_1 + 1/(r_2 + 1/(r_3 +...(r_{m-1} + 1/r_m)...)), a continued fraction of rational terms. Then a(n) is the sum of the (positive integer) terms in the simple continued fraction of r_n.at n=12A138744
• Number of binary strings of length n with equal numbers of 00000 and 11111 substrings.at n=14A164191
• Suppose e<f, e<h, g<f and g<h. To avoid fegh means not to have four consecutive letters such that the second and the third letters are less than the first and the fourth letters.at n=8A177482
• a(n) = floor((265/6)*4^(n-4) - n^2 - ((15+(-1)^(n-1))/6)* 2^(n-3)).at n=4A185098
• G.f.: (1+x^2+x^3)/(1-x-x^2-x^4-x^5).at n=16A188223
• Number of (n+1) X 4 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively.at n=17A204646
• 5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nX2 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=3A223426
• 5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nX4 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=1A223428
• T(n,k)=5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=11A223432
• T(n,k)=5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=13A223432
• Rounded sums of the non-integer cube roots of n, as partitioned by the integer roots: round(Sum_{j=n^3+1..(n+1)^3-1} j^(1/3)).at n=15A248575
• T(n,k) = Number of n X k 0..1 arrays with the number of 1s horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=37A285152
• Number of 2 X n 0..1 arrays with the number of 1's horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=7A285153
• Row sums of A192933.at n=5A336283
• G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)^(k+1) * (3^k + A(x^k)) * x^k/k ).at n=8A363543