[seqfan] A179680 (iterative reduction w.r.t. odd part)

[Richard Mathar]

Does anyone understand A179680? Take for example n=2, then
the iteration of calculations that take the highest power
of 2 that divides the term l(i) and m(i) as the the corresponding
odd part :

"n=", 2, "i=", 1, "l=", 0, "m=", 3   
  because n+1=3, 2^0 divides 3, m=3, set m(2) = n+m*(i-1)=2+3*1=5
"n=", 2, "i=", 2, "l=", 0, "m=", 5
  because 2^0 divides 5, m=5, set m(3) = n+m*(i-1)=2+5*2=12
"n=", 2, "i=", 3, "l=", 2, "m=", 3
  because 2^2 divides 12, m=3, set m(4) = n+m*(i-1)=2+3*3=11
"n=", 2, "i=", 4, "l=", 0, "m=", 11
"n=", 2, "i=", 5, "l=", 1, "m=", 23
"n=", 2, "i=", 6, "l=", 0, "m=", 117
"n=", 2, "i=", 7, "l=", 6, "m=", 11
"n=", 2, "i=", 8, "l=", 0, "m=", 79
"n=", 2, "i=", 9, "l=", 1, "m=", 317
"n=", 2, "i=", 10, "l=", 0, "m=", 2855
"n=", 2, "i=", 11, "l=", 3, "m=", 3569
"n=", 2, "i=", 12, "l=", 0, "m=", 39261

and this process does never end as far as I can see, so a(2)=1 does
not make sense in that environment.
The same description is copied verbatim to basically all the crossrefs
in A179680, which does not help in any way.

Richard Mathar