#include <stdio.h>
#define  MAX  64

main()
{
int  i, k, n;
long  u[MAX];
unsigned long  sum, cycl[MAX], two[MAX], anz[MAX];

/** Calculate Moebius Funktion u[] **/
u[1] = 1;
for (i=2;i<MAX;i++)
   u[i] = 2;
for (n=2;n<MAX;n++)
   if (u[n] == 2)
      for (k=n*n,i=n;i<MAX;i+=n)
      {  if (i==k)  u[i] = 0,  k += n*n;
         else if (u[i] > 0)  u[i] = -1;
         else if (u[i] < 0)  u[i] = 1;
      }

two[0] = 1;
for (n=1;n<MAX;n++)
{
   two[n] = 2*two[n-1];
   cycl[n] = (two[n] + (n%2 ? -2 : 2))/3;
   anz[n] = 0; /* cycl[1] == 0 */
   for (i=n/2;i;i--)
      if (!(n%i))
      {  sum = cycl[n/i];
         if (!(n%3))
            sum += (3-1)* ( i%3 ? two[n/3/i] : cycl[n/i] );
         if (!(n%2))
            sum += (2-1)* ( i%2 ? two[n/2/i] : 0 );
         anz[n] += u[i]*sum;
      }
   anz[n] /= 2*n;
   printf("n=%2d  cycl(n)=%20lu  anz(n)=%21lu  asym(n)=%21lu",
           n, cycl[n], anz[n], two[n]/6/n);
}

}