A simple algorithm I just thought up is this (A points to appvar, B points to output list)
:Fill(0->{B},6
:For(X,0,6
: {A+X}->Z
: For(Y,0,6
:  If {A+Y}>=Z
:   {B+Y}+1->{B+Y}
:  End
: End
:EndHaven't tested it, but it should work in theory.

Would this be for a turn-based RPG? For turns, I generally have the character and enemy have a speed attribute, usually from 1 to 99, and when battle begins, the char/enemy turn counters are set to a random value from LV to 2*LV. Then there's a loop where those two values increments. Once your char reaches 255, it's his turn to attack, and his value is reset to his speed LV. Same for enemy turns. In TI-BASIC this can be quite slow if you have 3vs3 battles, though.

Btw remember to archive or backup your stuff before testing random routines, so you won't lose too much if an error occurs.

Oh?
I thought that the Fill( command did that!



My fault.

It works.

Thank you, sir.

mhmm what do you mean? Does the data unintentionnally duplicates, or do you actually want to duplicate it?

hmmm, I haz an idea, give me a sec ok?  (or anyone else try it too)