37165

Appears in sequences

• a(n) = Sum_{j=0..n} j*Fibonacci(j).at n=16A014286
• Poincaré series [or Poincare series] (or Molien series) for a certain four-fold wreath product P_4.at n=56A091434
• Number of sets of exactly eight positive integers <= n having a square element sum.at n=16A281868
• Square array T(n,k), n >= 2, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding closed paths in the n X k grid graph which pass through all vertices on four (left, right, upper, lower) sides of the graph.at n=48A333758
• Square array T(n,k), n >= 2, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding closed paths in the n X k grid graph which pass through all vertices on four (left, right, upper, lower) sides of the graph.at n=51A333758
• Number of self-avoiding closed paths in the 5 X n grid graph which pass through all vertices on four (left, right, upper, lower) sides of the graph.at n=6A358696