34280

Appears in sequences

• Denominators of continued fraction convergents to sqrt(515).at n=10A041985
• a(n) = (4*n^3 + 6*n^2 + 8*n + 6)/3.at n=29A100504
• Number of binary strings of length n with equal numbers of 00100 and 01010 substrings.at n=16A164237
• Number of chordless cycles of length >=4 in the n X n camel graph.at n=8A362538
• Irregular triangular array read by rows. Let S_n be the set of labeled graphs G on [n] with 2-colored nodes where black nodes are only connected to white nodes and vice versa. Orient the edges in each such graph G from black to white. T(n,k) is the number of graphs in S_n containing exactly k descents, n>=0, 0<=k<=A002620(n).at n=34A381058