Determining Combinations with Restraints

public class BruteForcePermutation {
    
    public static boolean countUniqueChar(int num, char symb, String text){
        int count = 0;
        int textLength = text.length();
        char[] charArray = new char[textLength];
        
        charArray = text.toCharArray();
        
        for(int i = 0; i<textLength; i++)
            if(charArray[i]==symb)count++;
        
        if(count==num) return true;
        else return false;   
    }
    
    public static String intToBinary(int num, int size){
        String result = "";
        
        while(num!=0){
            result = (num%2) + result;
            num /= 2;
            size--;
        }
        
        while(size>0){
            result = "0" + result;
            size--;
        }
        
        return result;
    }
    
    public static void main(String[] args){
        String currentBin = "";
        int permutations;
        
        int terms = 10;
        for(int size = 2; size<=terms*2;size+=2){
            permutations = 0;
            for(int i = 0; i<Math.pow(2,size) ;i++){
                currentBin = intToBinary(i,size);
                if(countUniqueChar((size/2),'1',currentBin)){
                    //System.out.println(currentBin);
                    permutations++;
                }
            }
        System.out.print(permutations + " ");
        }
    }
}