This is based on an earlier version but has the added flexibility of being generated by a Python script from within Blender. Each level of recursion n produces 20^n dodecahedra. With n = 2, the script will run in a couple of seconds, but n = 3 can take over an hour. I don't know why it gets so slow.
Cura's experimental "tree" support option was particularly effective for this part.