Well, whatever OCD I suffer from, gaming is not one of them .
I think that first of all you need to consider which of the number sequences you want to use. Not all of them have interesting graphical interpretations. Once that's done I will try to, if time permits, establish reasonable limits, though I don't know exactly what you have in mind. Length limits depending on generation time? Or what?
By the way, here is another number sequence (this one is simple), the number of elements that can be stacked to form equilateral triangles:
I think that first of all you need to consider which of the number sequences you want to use. Not all of them have interesting graphical interpretations. Once that's done I will try to, if time permits, establish reasonable limits, though I don't know exactly what you have in mind. Length limits depending on generation time? Or what?
By the way, here is another number sequence (this one is simple), the number of elements that can be stacked to form equilateral triangles:
def triangular(n): # https://en.wikipedia.org/wiki/Triangular_number if n == 0: return [0] seq=[0]*n for i in range(1, n): seq[i] = (i*i + i) // 2 return seq print(triangular(100))Some of the sequence functions may need tweaking to be usable. I even thought that some sequences that are time consuming to generate could be stored in some database that offer B-tree indices. I'll look into that to see if it may speed up some hard to generate sequences (provided that you intend to use them). In the general case, opening and closing databases is in itself time consuming.