8 Apr
2014
8 Apr
'14
midnight
* Joerg Arndt <arndt@jjj.de> [Apr 07. 2014 19:57]:
[...]
http://oeis.org/A064415 a(1) = 0, a(n) = iter(n) if n is even, a(n) = iter(n)-1 if n is odd, where where iter(n) = A003434(n) = smallest number of iterations of Euler totient function phi needed to reach 1. http://oeis.org/A054725 a[1]=1; a[m]= sum[a[p-1]], where sum is over all primes (with multiplicity), p, that divide m.
[...]
WDS (personal email):
There's no way those OEIS sequences have anything to do with it, despite agreeing on your data.
Me: think again. Best, jj