23657

Appears in sequences

• Number of partitions of n into Fibonacci parts (with 2 types of 1).at n=45A007000
• Expansion of (3 - 21*x + 4*x^2)/((x-1)*(x^2 - 6*x + 1)).at n=6A009759
• a(n) = (a(n-1) * a(n-6) + 2 * a(n-3) * a(n-4)) / a(n-7). a(1) = ... = a(7) = 1. Somos-7 variation.at n=16A064268
• Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row.at n=28A095182
• a(n) = n*(14*n + 3).at n=41A195025
• Sum of all the parts in the partitions of n into 7 squarefree parts.at n=41A308953