171093

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, 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.at n=16A049943
• Breadth-first traversal of a binary tree in which the value at the n-th node is equal to ParentNode()*prime(n-1).at n=28A268878