23366

Appears in sequences

• 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) = a(2) = 1 and a(3) = 2.at n=40A050031
• Number of partitions p of n such that (maximal multiplicity of the parts of p) > (maximal part of p).at n=48A240314
• Number of isomers of C_n H_{2n+2} O_2.at n=11A381216