interval(10,200); gStepped=1; a[n] = numdiv(n); // number of divisors(n) // Try a demo script. // Or enter your own sequence a[n] = .... here. // See [Help] for more info // Support : echolalie@echolalie.com