Predecessor-completed Ascii Cubes The first Predecessor-completed Ascii Cube (PAC 1) is a simple cube with side length 1 and looks like this:

 /////\
/////  \
\\\\\  /
 \\\\\/


The PAC 2 is a geometric shape such that combining it with its predecessor (the  PAC 1) completes a side length 2 cube:

      front                back
   /////////\           /////////\
  /////////  \         /////////  \
 /////\\\\\   \       /////////    \
/////  \\\\\   \     /////////      \
\\\\\  /////   /     \\\\\\\\\      /
 \\\\\/////   /       \\\\\\\\\    /
  \\\\\\\\\  /         \\\\\\\\\  /
   \\\\\\\\\/           \\\\\\\\\/


Because the back-view is kind of boring, we are only interested in the front-view.

The same goes for the PAC 3: With some visual thinking the PAC 2 can be turned around and plugged into the PAC 3 to form a solid side length 3 cube:

     /////////////\
    /////////////  \
   /////\\\\\\\\\   \
  /////  \\\\\\\\\   \
 /////   /////\\\\\   \
/////   /////  \\\\\   \
\\\\\   \\\\\  /////   /
 \\\\\   \\\\\/////   /
  \\\\\  /////////   /
   \\\\\/////////   /
    \\\\\\\\\\\\\  /
     \\\\\\\\\\\\\/


And so on with PAC 4:

       /////////////////\
      /////////////////  \
     /////\\\\\\\\\\\\\   \
    /////  \\\\\\\\\\\\\   \
   /////   /////////\\\\\   \
  /////   /////////  \\\\\   \
 /////   /////\\\\\   \\\\\   \
/////   /////  \\\\\   \\\\\   \
\\\\\   \\\\\  /////   /////   /
 \\\\\   \\\\\/////   /////   / 
  \\\\\   \\\\\\\\\  /////   /
   \\\\\   \\\\\\\\\/////   /
    \\\\\  /////////////   /
     \\\\\/////////////   /
      \\\\\\\\\\\\\\\\\  /
       \\\\\\\\\\\\\\\\\/


Task:

Write a full program or function which takes a positive integer n as input and returns or prints the corresponding front-view of PAC n exactly as shown above. Additional trailing white space is acceptable.

This is code-golf, so try to use as few bytes as possible in the language of your choice.
JavaScript (ES6), 229 bytes



f=
(n,l=n*4+1,r=1,i=n*2,g=a=&gt;` / \\ /
`.replace(/./g,c=&gt;c.repeat(a.pop())))=&gt;n?g([r,,l,--i])+g([r,2,l,--i])+f(n-1,l-1?1:r-4,r-1?1:l-4).replace(/(\S).*(.)/g,r-1?`$1   $&amp;$2$2$2$2`:`$1$1$1$1$&amp;   $2`)+g([r,2,l,,,i])+g([r,,l,,,i+1]):``
&lt;input type=number min=0 oninput=o.textContent=f(+this.value)&gt;&lt;pre id=o&gt;