133186

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=18A049934
• Total number of distinct cycles in a particular cellular automata of size n.at n=23A083843
• Expansion of e.g.f. log( 1 + (exp(x) - 1)^2 / 2 ).at n=8A346974