title: Sum Series 12 32 52 2N 12
signature: function sum_series_12_32_52_2n_12(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(14, 3654);
      @printf("TEST-0...%s\n",result);
      
      result = driver(61, 302621);
      @printf("TEST-1...%s\n",result);
      
      result = driver(37, 67525);
      @printf("TEST-2...%s\n",result);
      
      result = driver(86, 848046);
      @printf("TEST-3...%s\n",result);
      
      result = driver(47, 138415);
      @printf("TEST-4...%s\n",result);
      
      result = driver(98, 1254890);
      @printf("TEST-5...%s\n",result);
      
      result = driver(70, 457310);
      @printf("TEST-6...%s\n",result);
      
      result = driver(24, 18424);
      @printf("TEST-7...%s\n",result);
      
      result = driver(76, 585276);
      @printf("TEST-8...%s\n",result);
      
      result = driver(24, 18424);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def sum_series_12_32_52_2n_12(n):
      sum = 0
      for i in range(1, (n + 1)):
          sum = (sum + (((2 * i) - 1) * ((2 * i) - 1)))
      return sum
source_cpp: int sum_series_12_32_52_2n_12(int n) {
    int sum = 0;
    for ( int i = 1;
    i <= n;
    i ++ ) sum = sum + ( 2 * i - 1 ) * ( 2 * i - 1 );
    return sum;
  }