The number of exponents >1 in a recursive reduction of 2n-1 until reaching an odd part equal to 1.
0, 1, 1, 1, 1, 3, 3, 1, 1, 5, 1, 3, 5, 5, 7, 1, 1, 3, 9, 3, 3, 3, 3, 6, 5, 2, 13, 5, 3, 15, 15, 1, 1
2 seqfan posts
Tue Apr 5 12:41:09 CEST 2011 [seqfan] Re: A179680 (iterative reduction w.r.t. odd part)