40963

Appears in sequences

• Partitioning integers to avoid arithmetic progressions of length 3.at n=25A006999
• A convolution triangle of numbers, generalizing Pascal's triangle A007318.at n=49A035324
• 5-fold convolution of A001700(n), n >= 0.at n=5A035330
• a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=2.at n=11A088578
• a(1)=1. a(n) = a(n-1) + (sum of terms, from among terms a(1) through a(n-1), which are prime or 1).at n=20A104589
• Numbers n such that sigma(n) is a Fibonacci number.at n=31A272412
• Number of non-equivalent ways to tile an n X n X n triangular area with two 2 X 2 X 2 triangular tiles and an appropriate number (= n^2-8) of 1 X 1 X 1 tiles.at n=25A286444
• Numbers k such that tau(k) and sigma(k) are both Fibonacci numbers.at n=17A390231