从http://www.erlang.org/doc/man/lists.html看，lists:seq(1, 100)就像你想做的那样。你也可以做lists:seq(1, 100, 2)这样的事情来得到这个范围内的所有奇数。

你可以使用list:seq(From, TO)，也就是@bitilly，你也可以使用列表解析来添加更多的功能，例如：

1> [X || X <- lists:seq(1,100), X rem 2 == 0].
[2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,
 44,46,48,50,52,54,56,58|...]

There is a difference between range in Ruby and list:seq in Erlang. Ruby's range doesn't create list and rely on next method, so (1..HugeInteger).each { ... } will not eat up memory. Erlang lists:seq will create list (or I believe it will). So when range is used for side effects, it does make a difference.
P.S. Not just for side effects:

(1..HugeInteger).inject(0) { |s, v| s + v % 1000000 == 0 ? 1 : 0 }

will work the same way as each, not creating a list. Erlang way for this is to create a recursive function. In fact, it is a concealed loop anyway.

Erlang中的懒惰流的例子。虽然它不是Erlang特有的，但我想它可以在任何有lambda的语言中完成。每次流被推进时都会创建新的lambda，所以它可能会给垃圾收集器带来一些压力。

range(From, To, _) when From > To ->
    done;
range(From, To, Step) ->
    {From, fun() -> range(From + Step, To, Step) end}.

list(done) ->
    [];
list({Value, Iterator}) ->
    [Value | list(Iterator())].

% ----- usage example ------

list_odd_numbers(From, To) ->
    list(range(From bor 1, To, 2)).