anchor.diff:           if(l.eq.1.and.m.eq.0)ylm_real=dsqrt(3.d0/fourpi)*zchap
            if(l.eq.1.and.m.eq.-1)ylm_real=dsqrt(3.d0/fourpi)*ychap
   
  -         if(l.eq.2.and.m.eq.2)ylm_real=dsqrt(15.d0/16.d0/pi)*(xchap**2-ychap**2)
  +         if(l.eq.2.and.m.eq.2)ylm_real=dsqrt(15.d0/16.d0/pi)*(xchap*xchap-ychap*ychap)
            if(l.eq.2.and.m.eq.1)ylm_real=dsqrt(15.d0/fourpi)*xchap*zchap
  -         if(l.eq.2.and.m.eq.0)ylm_real=dsqrt(5.d0/16.d0/pi)*(-xchap**2-ychap**2+2.d0*zchap**2)
  +         if(l.eq.2.and.m.eq.0)ylm_real=dsqrt(5.d0/16.d0/pi)*(-xchap*xchap-ychap*ychap+2.d0*zchap*zchap)
            if(l.eq.2.and.m.eq.-1)ylm_real=dsqrt(15.d0/fourpi)*ychap*zchap
            if(l.eq.2.and.m.eq.-2)ylm_real=dsqrt(15.d0/fourpi)*xchap*ychap
   
  
positive.code:   ! Int f_0
    coef_nk=1.d0/dble_fact( n+n+1 )
    expo=0.5d0*dfloat(n+l+1)
    crochet=dble_fact(n+l-1)/(2.d0*gam)**expo
    if(mod(n+l,2).eq.0)crochet=crochet*dsqrt(0.5d0*pi)
  
    f_0 = coef_nk*a**n*crochet
  
negative.code:     term_rap = term_a / (2.d0*gam)**expo
  
      s_0_0=term_rap*a**(n)*b**(m)
      if(mod(nlm,2).eq.0)s_0_0=s_0_0*dsqrt(pi*.5d0)
  
      ! Initialise the first recurence terme for the q loop
      s_q_0 = s_0_0
  