103412

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 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) = 3.at n=16A049956
• Number of 0..n arrays x(0..5) of 6 elements with nondecreasing average value.at n=10A200766
• G.f.: Product_{k>=1, j>=1} (1 + x^(k*j))^2.at n=20A320235