Design a sequence S₀, S₁, ... , S_∞ where each S_i
   1) is a string of characters from the set
      {φ, "right brace", "left brace", comma} (φ denotes the empty set),
   2) denotes a valid set, and
   3) |S_i| = i.

For clarity you can define substrings and use recursion.

Note; S_i = {φ,{φ},{φ},φ,{φ,{φ}}} = {φ,{φ},{φ,{φ}}}
                |S_i| = 3 not |S_i| = 5.

Note: φ = {}. I don't know if this will help.

A possible start: S₀ = φ , S₁ = {φ} , ...
  
 

Brazilian numbers | Rating: 3.00
Posted on 2017-07-15 by Ady TZIDON (Solution Posted, 4 Comments)

18 is not enough | Rating: 3.00
Posted on 2017-06-06 by Ady TZIDON (No Solution Yet, 2 Comments)

The sum of 2016 terms |
Posted on 2017-03-21 by Ady TZIDON (No Solution Yet, 1 Comments)

Given VI, evaluate VII |
Posted on 2017-02-01 by Ady TZIDON (No Solution Yet, 1 Comments)

A chain of powers |
Posted on 2016-12-22 by Ady TZIDON (No Solution Yet, 1 Comments)

Primitive Prime Divisors |
Posted on 2016-12-17 by broll (No Solution Yet, 0 Comments)

In terzo luogo |
Posted on 2016-11-13 by Ady TZIDON (No Solution Yet, 4 Comments)