It took me 5 minutes (so long time) Python version (the same picture, just bigger): import turtle as t import math as m def recursion(size): if size < 5: t.pendown() for i in range(5): t.forward(size) t.left(72) t.penup() else: divide = 2 + m.cos(18) for i in range(5): recursion(size / divide) t.forward(size) t.left(72) t.penup() t.goto(-300, -342) t.color('black') t.speed(100) t.pensize(2) recursion(450)
