26014

Appears in sequences

• -1 + number of partitions of n.at n=38A000065
• Row 3 of square array defined in A047671.at n=23A047672
• a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=32A050043
• Poincaré series [or Poincare series] (or Molien series) for a certain five-fold wreath product P_5.at n=45A091726
• Number of nondecreasing strings of numbers x(i=1..n) in -4..4 with sum x(i)^3 equal to 0.at n=25A188272
• Triangle read by rows: T(n,k) = T(n-k,k-1) + 2*T(n-k,k) + T(n-k,k+1) with T(0,0) = 1 for 0 <= k <= A003056(n).at n=57A291929
• Number of partitions lambda of n that satisfy gcd(lambda_i, n-1) = 1 for all i and for which the lattice simplex delta(lambda) is an antichain simplex.at n=37A323257
• a(n) is the number of trivial braids on 3 strands which are products of n generators a, b, where a = sigma_1 sigma_2 sigma_1 and b = sigma_1 sigma_2.at n=10A358653
• Number of integer partitions of n not forming an arithmetic progression with offset 0.at n=38A389920