37944

Appears in sequences

• a(n) = (n + 1)*(n + 2)*(n + 4)*(n + 8)*(n + 15)/120.at n=16A006636
• Number of ternary Lyndon words of length n with trace 0 and subtrace 0 over GF(3).at n=13A053548
• Number of ternary Lyndon words of length n with trace 1 and subtrace 1 over GF(3). Same as the number of ternary Lyndon words of length n with trace 2 and subtrace 1 over GF(3).at n=13A053563
• Even numbers k such that the central binomial coefficient A000984(k, k/2) is divisible by k^2.at n=24A080395
• A subclass of quasi-acyclic automata with 3 inputs, n transient and k absorbing labeled states.at n=17A082172
• Unreduced numerators of the elements T(n,k)/(n-k)!, read by rows, of the triangular matrix P^-1, which is the inverse of the matrix defined by P(n,k) = (1-(k+1)^3)^(n-k)/(n-k)! for n >= k >= 1.at n=18A103243
• Number of 7 X 7 arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to n.at n=33A156392
• Number of n X n arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to 33.at n=4A156494
• Let y=(1-sqrt(1-4*z))/(1+sqrt(1-4*z)) denote the g.f. for the Catalan numbers (A000108); sequence has g.f. sum(k>=1, y^(2^k)/(1+y^(2^(k+1))) ).at n=10A191606
• Number of n X 4 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=15A209646
• Number of n X n binary arrays with top left element equal to 1 and no two ones adjacent horizontally or nw-se.at n=4A228790
• Number of n X 5 binary arrays with top left element equal to 1 and no two ones adjacent horizontally or nw-se.at n=4A228793
• T(n,k)=Number of nXk binary arrays with top left element equal to 1 and no two ones adjacent horizontally or nw-se.at n=40A228796
• Number of 5Xn binary arrays with top left element equal to 1 and no two ones adjacent horizontally or nw-se.at n=4A228800
• Numbers n such that the sum of the prime factors (including repeats) of prime(n)-1 and prime(n+1)-1 are the same.at n=21A259564
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 1", based on the 5-celled von Neumann neighborhood.at n=38A269908
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 275", based on the 5-celled von Neumann neighborhood.at n=37A271093
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 347", based on the 5-celled von Neumann neighborhood.at n=38A271299
• Number of (undirected) paths in the n-antiprism graph.at n=5A287988
• a(n) = (1/8)*A290915(n).at n=8A290916