%%----------------------------------------------------------------
%%   All the programs as listed in the book in the Appendix    ---
%%----------------------------------------------------------------


#include <stdio.h>
#define MAXSIZE 13

void main()
{
    int SetPartition[MAXSIZE],n=4;
    int i,max,j=n;

    while(j>0)
    {
        for(i=1;i<=n;i++) SetPartition[i]=1;
        printf("\n");

        max=0;
        for(i=1;i<j;i++)
            if (SetPartition[i]>max) max=SetPartition[i];

        while(SetPartition[j]==max+1)
        {
            j--; max=0;
            for(i=1;i<j;i++)
               if (SetPartition[i]>max) max=SetPartition[i];
        }
        if (j>0)
        {
            SetPartition[j]++;
            for(i=j+1;i<=n;i++) SetPartition[i]=1;
            j=n;
        }
    }
}

%------------------------------------------------------------------------

#include <stdio.h>
#define MAXSIZE 13
int SetPartition[MAXSIZE],n=4;

void main()
{
    int i,j,p,pos,kp,tt;
    int s[MAXSIZE][MAXSIZE],ls[MAXSIZE],
        fs[MAXSIZE][MAXSIZE],ns[MAXSIZE];
    SetPartition[1]=1; s[1][1]=1; ls[1]=1; fs[1][1]=1; ns[1]=1;

    for(i=2;i<=n;i++)
    {
        SetPartition[i]=1; s[i][1]=1; s[i][2]=2;
        ls[i]=2; fs[1][1]=1; fs[i][2]=0; ns[i]=1;
    }
    pos=2;
    while(pos>1)
    {
        for(i=1;i<=n;i++) SetPartition[i]=1;
        printf("\n");

        pos=n;
        while(ns[pos]==ls[pos]) pos--;
        if (pos>0)
        {
            p=0;
            for(i=1;i<=pos-1;i++)
                if(SetPartition[i]>p) p=SetPartition[i];
            kp=ls[pos];
            while(fs[pos][kp]==1) kp--;
            ns[pos]++;
            SetPartition[pos]=s[pos][kp]; fs[pos][kp]=1;
            for(i=pos;i<=n-1;i++)
            {
                if(p<pi[i]) p=SetPartition[i];
                ns[i+1]=1;
                for(j=2;j<=p+1;j++)
                {
                    s[i+1][j-1]=j; fs[i+1][j-1]=0;
                }
                s[i+1][p+1]=1; ls[i+1]=p+1; fs[i+1][p+1]=0;
                if(SetPartition[i+1]>1)
                    fs[i+1][SetPartition[i+1]-1]=1;
                else
                    fs[i+1][p+1]=1;
            }
        }
    }
}

%-------------------------------------------------------------------------------

#include <stdio.h>
#define MAXSIZE 50
int n,SetPartition[MAXSIZE],pattern[MAXSIZE],tau[MAXSIZE],lentau;
long num1=0;

int order(int a,int b)
{ if (a==b) return 0;
  else if(a>b) return 1;
       else return -1;
}

int test(int k,int *p1,int *p2)
{ int i;
  for (i=0;i<k;i++)
    if (order(p1[i],p1[k])!=order(p2[i],p2[k])) return 1;
  return 0;
}

int vpatterns3()
{ int cur[3],i1,i2,i3;
   for(i3=0;i3<n-2;i3++){
     cur[0]=SetPartition[i3];
     for(i2=i3+1;i2<n-1;i2++){
        cur[1]=SetPartition[i2];
        if (test(1,cur,tau)) continue;
           for(i1=i2+1;i1<n;i1++){
              cur[2]=SetPartition[i1];
              if (!test(2,cur,tau)) return 0;
        }
     }
   }
   return 1;
}

int vpatterns4()
{ int cur[4],i1,i2,i3,i4;
   for(i4=0;i4<n-3;i4++){
     cur[0]=SetPartition[i4];
     for(i3=i4+1;i3<n-2;i3++){
        cur[1]=SetPartition[i3];
        if (test(1,cur,tau)) continue;
        for(i2=i3+1;i2<n-1;i2++){
           cur[2]=SetPartition[i2];
           if (test(2,cur,tau)) continue;
           for(i1=i2+1;i1<n;i1++){
              cur[3]=SetPartition[i1];
              if (!test(3,cur,tau)) return 0;
           }
        }
     }
   }
   return 1;
}

int vpatterns5()
{ int cur[5],i1,i2,i3,i4,i5;
   for(i5=0;i5<n-4;i5++){
     cur[0]=SetPartition[i5];
     for(i4=i5+1;i4<n-3;i4++){
        cur[1]=SetPartition[i4];
        if (test(1,cur,tau)) continue;
        for(i3=i4+1;i3<n-2;i3++){
          cur[2]=SetPartition[i3];
          if (test(2,cur,tau)) continue;
          for(i2=i3+1;i2<n-1;i2++){
            cur[2]=SetPartition[i2];
            if (test(3,cur,tau)) continue;
            for(i1=i2+1;i1<n;i1++){
              cur[3]=SetPartition[i1];
              if (!test(4,cur,tau)) return 0;
            }
          }
        }
      }
   }
   return 1;
}

int vpatterns6()
{ int cur[6],i1,i2,i3,i4,i5,i6;
  for(i6=0;i6<n-5;i6++){
     cur[0]=SetPartition[i6];
     for(i5=i6+1;i5<n-4;i5++){
        cur[1]=SetPartition[i5];
        if (test(1,cur,tau)) continue;
        for(i4=i5+1;i4<n-3;i4++){
           cur[2]=SetPartition[i4];
           if (test(2,cur,tau)) continue;
           for(i3=i4+1;i3<n-2;i3++){
              cur[3]=SetPartition[i3];
              if (test(3,cur,tau)) continue;
              for(i2=i3+1;i2<n-1;i2++){
                 cur[4]=SetPartition[i2];
                 if (test(4,cur,tau)) continue;
                 for(i1=i2+1;i1<n;i1++){
                    cur[5]=SetPartition[i1];
                    if (!test(5,cur,tau)) return 0;
                 }
              }
           }
        }
     }
  }
  return 1;
}

int vpatterns7()
{ int cur[7],i1,i2,i3,i4,i5,i6,i7;
  for(i7=0;i7<n-6;i7++){
     cur[0]=SetPartition[i7];
     for(i6=i7+1;i6<n-5;i6++){
        cur[1]=SetPartition[i6];
        if (test(1,cur,tau)) continue;
        for(i5=i6+1;i5<n-4;i5++){
           cur[2]=SetPartition[i5];
           if (test(2,cur,tau)) continue;
           for(i4=i5+1;i4<n-3;i4++){
              cur[3]=SetPartition[i4];
              if (test(3,cur,tau)) continue;
              for(i3=i4+1;i3<n-2;i3++){
                 cur[4]=SetPartition[i3];
                 if (test(4,cur,tau)) continue;
                 for(i2=i3+1;i2<n-1;i2++){
                    cur[5]=SetPartition[i2];
                    if (test(5,cur,tau)) continue;
                    for(i1=i2+1;i1<n;i1++){
                       cur[6]=SetPartition[i1];
                       if (!test(6,cur,tau)) return 0;
                    }
                 }
              }
           }
        }
     }
  }
  return 1;
}

void patterns()
{ if(lentau==3) num1=num1+vpatterns3();
  if(lentau==4) num1=num1+vpatterns4();
  if(lentau==5) num1=num1+vpatterns5();
  if(lentau==6) num1=num1+vpatterns6();
  if(lentau==7) num1=num1+vpatterns7();
}

void builtsp(int l)
{
  int j,i,vv,mvv,i1,i2,i3;
  if (l==n)
  {
	mvv=0;
    for(i1=0;i1<n;i1++)
      if(pattern[i1]>mvv) mvv=pattern[i1];
	i3=0;
	for(i1=1;i1<=mvv;i1++)
	{
	   for(i2=0;i2<n;i2++)
          if(pattern[i2]==i1) {SetPartition[i3]=i2+1; i3++;}
	}
    patterns();
  }
  else
  {
	vv=0;
    for(i=0;i<l;i++)
      if(pattern[i]>vv) vv=pattern[i];
    for(j=1;j<=vv+1;j++)
	{
		pattern[l]=j; builtsp(l+1);
	}
  }
}


int main()
{
  int i,j,s=0;
  printf("Give me the length (3-7) of the pattern :");
  scanf("%d",&lentau);
  printf("Write a pattern as sequence (example 3 1 2) :");
  for(i=0;i<lentau;i++) scanf("%d",&tau[i]);

  printf("The pattern tau equals ");
  for(i=0;i<lentau;i++) printf("%d",tau[i]);

  for(n=2;n<13;n++)
    {
         num1=0;  for(i=0;i<n;i++) pattern[i]=0;
         builtsp(0);
         printf("\n |Flatten_%d(tau)|=%d",n,num1);
     }
  printf("\n");
  return(1);
}

%--------------------------------------------------------------------------------

#include <stdio.h>
#define MAXSIZE 50
int n,word[MAXSIZE],tau[MAXSIZE],lentau;
long num1=0;

int order(int a,int b)
{ if (a==b) return 0;
  else if(a>b) return 1;
       else return -1;
}

int test(int k,int *p1,int *p2)
{ int i;
  for (i=0;i<k;i++)
    if (order(p1[i],p1[k])!=order(p2[i],p2[k])) return 1;
  return 0;
}

int vpatterns3()
{ int curword[3],i1,i2,i3;
   for(i3=0;i3<n-2;i3++){
     curword[0]=word[i3];
     i2=i3+1; curword[1]=word[i2];
     if (test(1,curword,tau)) continue;
     i1=i2+1; curword[2]=word[i1];
     if (!test(2,curword,tau)) return 0;
   }
   return 1;
}

int vpatterns4()
{ int curword[4],i1,i2,i3,i4;
   for(i4=0;i4<n-3;i4++){
     curword[0]=word[i4];
     i3=i4+1; curword[1]=word[i3];
     if (test(1,curword,tau)) continue;
     i2=i3+1; curword[2]=word[i2];
     if (test(2,curword,tau)) continue;
     i1=i2+1; curword[3]=word[i1];
     if (!test(3,curword,tau)) return 0;
   }
   return 1;
}

int vpatterns5()
{ int curword[5],i1,i2,i3,i4,i5;
   for(i5=0;i5<n-4;i5++){
     curword[0]=word[i5];
     i4=i5+1; curword[1]=word[i4];
     if (test(1,curword,tau)) continue;
     i3=i4+1; curword[2]=word[i3];
     if (test(2,curword,tau)) continue;
     i2=i3+1; curword[2]=word[i2];
     if (test(3,curword,tau)) continue;
     i1=i2+1; curword[3]=word[i1];
     if (!test(4,curword,tau)) return 0;
   }
   return 1;
}

int vpatterns6()
{ int curword[6],i1,i2,i3,i4,i5,i6;
  for(i6=0;i6<n-5;i6++){
     curword[0]=word[i6];
     i5=i6+1; curword[1]=word[i5];
     if (test(1,curword,tau)) continue;
     i4=i5+1; curword[2]=word[i4];
     if (test(2,curword,tau)) continue;
     i3=i4+1; curword[3]=word[i3];
     if (test(3,curword,tau)) continue;
     i2=i3+1; curword[4]=word[i2];
     if (test(4,curword,tau)) continue;
     i1=i2+1; curword[5]=word[i1];
     if (!test(5,curword,tau)) return 0;
  }
  return 1;
}

int vpatterns7()
{ int curword[7],i1,i2,i3,i4,i5,i6,i7;
  for(i7=0;i7<n-6;i7++){
     curword[0]=word[i7];
     i6=i7+1; curword[1]=word[i6];
     if (test(1,curword,tau)) continue;
     i5=i6+1; curword[2]=word[i5];
     if (test(2,curword,tau)) continue;
     i4=i5+1; curword[3]=word[i4];
     if (test(3,curword,tau)) continue;
     i3=i4+1; curword[4]=word[i3];
     if (test(4,curword,tau)) continue;
     i2=i3+1; curword[5]=word[i2];
     if (test(5,curword,tau)) continue;
     i1=i2+1; curword[6]=word[i1];
     if (!test(6,curword,tau)) return 0;
  }
  return 1;
}

void patterns()
{ if(lentau==3) num1=num1+vpatterns3();
  if(lentau==4) num1=num1+vpatterns4();
  if(lentau==5) num1=num1+vpatterns5();
  if(lentau==6) num1=num1+vpatterns6();
  if(lentau==7) num1=num1+vpatterns7();
}

void builsp(int l)
{
  int j,i,vv;
  if (l==n) patterns();
  else
  {
	vv=0;
    for(i=0;i<l;i++)
      if(word[i]>vv) vv=word[i];
    for(j=1;j<=vv+1;j++)
	{
		pword[l]=j; builsp(l+1);
	}
  }
}

int main()
{
  int i,j,s=0;
  printf("Give me the length (3-7) of the pattern :");
  scanf("%d",&lentau);
  printf("Write a pattern as sequence (example 3 1 2) :");
  for(i=0;i<lentau;i++) scanf("%d",&tau[i]);

  printf("The pattern tau equals ");
  for(i=0;i<lentau;i++) printf("%d",tau[i]);

  for(n=1;n<13;n++)
    {
         num1=0;  for(i=0;i<n;i++) word[i]=0;
         builtsp(0);
         printf("\n |P_%d(tau)|=%d",n,num1);
     }
  printf("\n");
  return(1);
}

%--------------------------------------------------------------------

#include <stdio.h>
#define MAXSIZE 50
int n,word[MAXSIZE],p[MAXSIZE];
int nlet[MAXSIZE];
long num1=0;
int listp[1000][7],nlistp=0;
FILE *fout;

int order(int a,int b)
{ if (a==b) return 0;
  else if(a>b) return 1;
         else return -1;
}

int test(int k,int *p1,int *p2)
{ int i;
  for (i=0;i<k;i++)
    if (order(p1[i],p1[k])!=order(p2[i],p2[k])) return 1;
  return 0;
}

int vpatterns3()
{ int curword[3];
   int i1,i2,i3;
   for(i3=0;i3<n-2;i3++){
     curword[0]=word[i3];
     for(i2=i3+1;i2<n-1;i2++){
           curword[1]=word[i2];
           if (test(1,curword,p)) continue;
           for(i1=i2+1;i1<n;i1++){
              curword[2]=word[i1];
              if (!test(2,curword,p))
                 return 0;
           }
     }
   }
   return 1;
}

int vpatterns4()
{ int curword[4];
   int i1,i2,i3,i4;
   for(i4=0;i4<n-3;i4++){
     curword[0]=word[i4];
     for(i3=i4+1;i3<n-2;i3++){
        curword[1]=word[i3];
        if (test(1,curword,p)) continue;
        for(i2=i3+1;i2<n-1;i2++){
           curword[2]=word[i2];
           if (test(2,curword,p)) continue;
           for(i1=i2+1;i1<n;i1++){
              curword[3]=word[i1];
              if (!test(3,curword,p))
                 return 0;
           }
        }
     }
   }
   return 1;
}

int vpatterns5()
{ int curword[5];
  int i1,i2,i3,i4,i5;
  for(i5=0;i5<n-4;i5++){
     curword[0]=word[i5];
     for(i4=i5+1;i4<n-3;i4++){
        curword[1]=word[i4];
        if (test(1,curword,p)) continue;
        for(i3=i4+1;i3<n-2;i3++){
           curword[2]=word[i3];
           if (test(2,curword,p)) continue;
           for(i2=i3+1;i2<n-1;i2++){
              curword[3]=word[i2];
              if (test(3,curword,p)) continue;
              for(i1=i2+1;i1<n;i1++){
                 curword[4]=word[i1];
                 if (!test(4,curword,p))
                   return 0;
              }
           }
        }
     }
  }
  return 1;
}

int vpatterns6()
{ int curword[6];
  int i1,i2,i3,i4,i5,i6;
  for(i6=0;i6<n-5;i6++){
     curword[0]=word[i6];
     for(i5=i6+1;i5<n-4;i5++){
        curword[1]=word[i5];
        if (test(1,curword,p)) continue;
        for(i4=i5+1;i4<n-3;i4++){
           curword[2]=word[i4];
           if (test(2,curword,p)) continue;
           for(i3=i4+1;i3<n-2;i3++){
              curword[3]=word[i3];
              if (test(3,curword,p)) continue;
              for(i2=i3+1;i2<n-1;i2++){
                 curword[4]=word[i2];
                 if (test(4,curword,p)) continue;
                 for(i1=i2+1;i1<n;i1++){
                    curword[5]=word[i1];
                    if (!test(5,curword,p))
                      return 0;
                 }
              }
           }
        }
     }
  }
  return 1;
}

int vpatterns7()
{ int curword[7];
  int i1,i2,i3,i4,i5,i6,i7;
  for(i7=0;i7<n-6;i7++){
     curword[0]=word[i7];
     for(i6=i7+1;i6<n-5;i6++)
{         curword[1]=word[i6];
        if (test(1,curword,p)) continue;
        for(i5=i6+1;i5<n-4;i5++){
           curword[2]=word[i5];
           if (test(2,curword,p)) continue;
           for(i4=i5+1;i4<n-3;i4++){
              curword[3]=word[i4];
              if (test(3,curword,p)) continue;
              for(i3=i4+1;i3<n-2;i3++){
                 curword[4]=word[i3];
                 if (test(4,curword,p)) continue;
                 for(i2=i3+1;i2<n-1;i2++){
                    curword[5]=word[i2];
                    if (test(5,curword,p)) continue;
                    for(i1=i2+1;i1<n;i1++){
                       curword[6]=word[i1];
                       if (!test(6,curword,p))
                          return 0;
                    }
                 }
              }
           }
        }
     }
  }
  return 1;
}

void builtsp(int l,int lenp)
{ int j,i,vv;
  if ((l==n))
  {
	  if(word[0]==1)
	  {
		 if(lenp==3) num1=num1+vpatterns3();
		 if(lenp==4) num1=num1+vpatterns4();
		 if(lenp==5) num1=num1+vpatterns5();
	     if(lenp==6) num1=num1+vpatterns6();
		 if(lenp==7) num1=num1+vpatterns7();
	  }
  }
  else
  {
	vv=0; for(i=0;i<l;i++) if(word[i]>vv) vv=word[i];
    for(j=1;j<=vv+1;j++)
	{
	   nlet[j]++; word[l]=j;
    	builtwsp(l+1,lenp);
	   nlet[j]--;
	}
  }
}

void builtpatterns(int l,int lenp)
{ int i,j,v;
  if (l==lenp)
  {
      for(i=0;i<lenp;i++) listp[nlistp][i]=p[i];
	  nlistp++;
  }
  else
  {
	v=0; for(i=0;i<l;i++) if(p[i]>v) v=p[i];
    for(j=1;j<=(v+1);j++)
	{
		p[l]=j; 		
		builtpatterns(l+1,lenp);
	}
  }
}

int main()
{
  int  lenp=7;
  fout=fopen("fpart7.txt","w");
  builtpatterns(0,lenp);
  int i,j,i1,j1,j2,ii,sw;
  int ncc=0;

for(i1=0;i1<nlistp;i1++)
{
	for(i=0;i<lenp;i++) p[i]=listp[i1][i];
    printf("patterns "); fprintf(fout,"patterns ");
    for(i=0;i<lenp;i++) {printf("%d",p[i]); fprintf(fout,"%d",p[i]);}
	printf(" : "); fprintf(fout," : ");

    for(n=7;n<13;n++)
      {
         num1=0; num2=0;
         for(i=0;i<n;i++) {word[i]=0; nlet[i]=0;}
         builtwords(0,lenp,lenq);
         printf("%7d ",num1); fprintf(fout,"%7d ",num1);
      }
	ncc++;
    printf("\n");
    fprintf(fout,"\n");
}

  fclose(fout);
  return(1);
}

%---------------------------------------------

#include <stdio.h>
#define MAXSIZE 50
int n,NK;
int word[MAXSIZE],p[MAXSIZE];
long num1=0;
int listp[100000][10],nlistp=0,nl=0;
int nlet[MAXSIZE];

FILE *fout; /*file contains the output*/

int order(int a,int b)
{ if (a==b) return 0;
  else if(a>b) return 1;
       else return -1;
}

int test(int k,int *p1,int *p2)
{ int i;
  for (i=0;i<k;i++)
    if (order(p1[i],p1[k])!=order(p2[i],p2[k])) return 1;
  return 0;
}

int c1patterns3()
{ int curword[4];
   int i1,i2,i4,acc=0;
   for(i4=0;i4<n-2;i4++){
      curword[0]=word[i4];
      for(i2=i4+1;i2<n-1;i2++){
		   curword[1]=word[i2];
           if (test(1,curword,p)) continue;
           for(i1=i2+1;i1<n;i1++){	
			  curword[2]=word[i1];
              if (!test(2,curword,p))
			  {acc++; if(acc>1) return 0;}
           }
        }
    }
   if (acc==1) return 1;
   else return 0;
}

int c1patterns4()
{ int curword[4];
   int i1,i2,i3,i4,acc=0;
   for(i4=0;i4<n-3;i4++){
     curword[0]=word[i4];
     for(i3=i4+1;i3<n-2;i3++){
        curword[1]=word[i3];
        if (test(1,curword,p)) continue;
        for(i2=i3+1;i2<n-1;i2++){
           curword[2]=word[i2];
           if (test(2,curword,p)) continue;
           for(i1=i2+1;i1<n;i1++){
              curword[3]=word[i1];
              if (!test(3,curword,p))
			  {acc++; if(acc>1) return 0;}
           }
        }
     }
   }
   if(acc==1) return 1;
   else return 0;
}

int c1patterns5()
{ int curword[5];
  int i1,i2,i3,i4,i5,acc=0;
  for(i5=0;i5<n-4;i5++){
     curword[0]=word[i5];
     for(i4=i5+1;i4<n-3;i4++){
        curword[1]=word[i4];
        if (test(1,curword,p)) continue;
        for(i3=i4+1;i3<n-2;i3++){
           curword[2]=word[i3];
           if (test(2,curword,p)) continue;
           for(i2=i3+1;i2<n-1;i2++){
              curword[3]=word[i2];
              if (test(3,curword,p)) continue;
              for(i1=i2+1;i1<n;i1++){
                 curword[4]=word[i1];
                 if (!test(4,curword,p))
				 {acc++; if (acc>1) return 0;}
              }
           }
        }
     }
  }
  if(acc==1) return 1;
  else return 0;
}

int c1patterns6()
{ int curword[6];
  int i1,i2,i3,i4,i5,i6,acc=0;
  for(i6=0;i6<n-5;i6++){
     curword[0]=word[i6];
     for(i5=i6+1;i5<n-4;i5++){
        curword[1]=word[i5];
        if (test(1,curword,p)) continue;
        for(i4=i5+1;i4<n-3;i4++){
           curword[2]=word[i4];
           if (test(2,curword,p)) continue;
           for(i3=i4+1;i3<n-2;i3++){
              curword[3]=word[i3];
              if (test(3,curword,p)) continue;
              for(i2=i3+1;i2<n-1;i2++){
                 curword[4]=word[i2];
                 if (test(4,curword,p)) continue;
                 for(i1=i2+1;i1<n;i1++){
                    curword[5]=word[i1];
                    if (!test(5,curword,p))
					{acc++; if(acc>1) return 0;}
                 }
              }
           }
        }
     }
  }
  if (acc==1) return 1;
  else return 0;
}

int c1patterns7()
{ int curword[7];
  int i1,i2,i3,i4,i5,i6,i7,acc=0;
  for(i7=0;i7<n-6;i7++){
     curword[0]=word[i7];
     for(i6=i7+1;i6<n-5;i6++){
        curword[1]=word[i6];
        if (test(1,curword,p)) continue;
        for(i5=i6+1;i5<n-4;i5++){
           curword[2]=word[i5];
           if (test(2,curword,p)) continue;
           for(i4=i5+1;i4<n-3;i4++){
              curword[3]=word[i4];
              if (test(3,curword,p)) continue;
              for(i3=i4+1;i3<n-2;i3++){
                 curword[4]=word[i3];
                 if (test(4,curword,p)) continue;
                 for(i2=i3+1;i2<n-1;i2++){
                    curword[5]=word[i2];
                    if (test(5,curword,p)) continue;
                    for(i1=i2+1;i1<n;i1++){
                       curword[6]=word[i1];
                       if (!test(6,curword,p))
                       {acc++; if(acc>1) return 0;}
                    }
                 }
              }
           }
        }
     }
  }
  if (acc==1) return 1;
  else return 0;
}

int sparse()
{
	int i;
	for(i=0;i<n-1;i++) if (word[i]==word[i+1]) return(0);
	for(i=0;i<n;i++) printf("%d",word[i]);
	return(1);
}

void builtsp(int l,int lenp)
{ int j,i,vv,vv1;
  if (l==n)
  {
	  if(word[0]==1)
	  {
		  if((lenp==3)) {num1=num1+c1patterns3();}
		  if((lenp==4)) {num1=num1+c1patterns4();}
		  if((lenp==5)) {num1=num1+c1patterns5();}
		  if((lenp==6)) {num1=num1+c1patterns6();}
		  if((lenp==7)) {num1=num1+c1patterns7();}
	  }
  }
  else
  {
	vv=0; for(i=0;i<l;i++) if(word[i]>vv) vv=word[i];
    for(j=1;j<=vv+1;j++)
	{
	   nlet[j]++;
	   word[l]=j;
	   builtsp(l+1,lenp);
	   nlet[j]--;
	}
  }
}

void builtpatterns(int l,int lenp)
{ int i,j,v;
  if (l==lenp)
  {
      for(i=0;i<lenp;i++) listp[nlistp][i]=p[i];
	  nlistp++;
  }
  else
  {
	v=0; for(i=0;i<l;i++) if(p[i]>v) v=p[i];
    for(j=1;j<=(v+1);j++)
	{
		p[l]=j; 		
		builtpatterns(l+1,lenp);
	}
  }
}

int main()
{
  int lenp=4, max_n=12;

  fout=fopen("sppart_one4.txt","w");
  builtpatterns(0,lenp);
	
  int i,j,i1,j1,j2,ii,sw;
  int ncc=0;

  for(i1=0;i1<nlistp;i1++)
    {
	printf("%d)",ncc+1);
	for(i=0;i<lenp;i++) p[i]=listp[i1][i];
    printf("patterns "); fprintf(fout,"patterns ");
    for(i=0;i<lenp;i++) {printf("%d",p[i]); fprintf(fout,"%d",p[i]);}
	printf(" :");
	fprintf(fout," : ");

    for(n=1;n<max_n;n++)
      {
         num1=0;
         for(i=0;i<n;i++) {word[i]=0; nlet[i]=0;}
         builtwords(0,lenp);
         printf("%5d ",num1); fprintf(fout,"%5d ",num1);
      }
    printf("\n"); fprintf(fout,"\n");
	}
  fclose(fout);
  return(1);
}