72558

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) = 1 and a(2) = a(3) = 3.at n=16A049974
• Number of length n+4 0..5 arrays with every five consecutive terms having four times some element equal to the sum of the remaining four.at n=21A249653
• Total number of ascents in all heapable permutations of length n.at n=8A389792