61398

Appears in sequences

• Cycle-path coverings of a family of digraphs.at n=11A030236
• Number of (n+2) X 3 binary matrices with every 3 X 3 block having exactly four 1's.at n=6A181255
• Number of (n+2)X9 binary matrices with every 3X3 block having exactly four 1's.at n=0A181261
• T(n,k) = number of (n+2) X (k+2) binary matrices with every 3 X 3 block having exactly four 1's.at n=21A181262
• T(n,k) = number of (n+2) X (k+2) binary matrices with every 3 X 3 block having exactly four 1's.at n=27A181262
• Number of n-length words w over a 10-ary alphabet such that w is empty or a prefix z concatenated with letter a_i and i=1 or 0 < #(z,a_{i-1}) >= #(z,a_i), where #(z,a_i) counts the occurrences of the i-th letter in z.at n=10A240616
• Number of n-length words w over an n-ary alphabet such that w is empty or a prefix z concatenated with letter a_i and i=1 or 0 < #(z,a_{i-1}) >= #(z,a_i), where #(z,a_i) counts the occurrences of the i-th letter in z.at n=10A240617
• a(0) = 0, and for n > 0, (a(n)) gives the indices n for which d(n) > d(k) for k < n, where d is the difference sequence of (cos k + sin k).at n=16A299639
• a(n) is the sum of all products of pairs of numbers joined by the diagonals of an n-gon when its vertices are numbered from 1 to n in order.at n=26A337130