Eric Angelini, <a href="/A130228/b130228_1.txt">Table of n, a(n) for n = 1..153</a>

proposed

approved

editing

proposed

Eric Angelini, Aug 05 2007, <a href="/A130228/b130228_1.txt">Table of n, a(n) for n = 1..154153</a>

approved

editing

editing

approved

_Eric Angelini_, , Aug 05 2007, <a href="/A130228/b130228.txt">Table of n, a(n) for n = 1..154</a>

approved

editing

_Eric Angelini (eric.angelini(AT)kntv.be), _, Aug 05 2007, <a href="/A130228/b130228.txt">Table of n, a(n) for n = 1..154</a>

_Eric Angelini (eric.angelini(AT)kntv.be), _, Aug 05 2007

Eric Angelini (eric.angelini(AT)kntv.be), Aug 05 2007, <a href="/A130228/b130228.txt">Table of n, a(n) for n = 1..154</a>

Gerard Schildberger, <a href="/A006968/a006968.txt">The first 3999 numbers in Roman numerals</a>

base,easy,nonn,new

Eric Angelini (eric.angelini(AT)kntv.be), Aug 05 2007, <a href="http://www.research.att.com/~njas/sequences/b130228.txt">Table of n, a(n) for n = 1..154</a>

Gerard Schildberger, <a href="http://www.research.att.com/~njas/sequences/a006968.txt">The first 3999 numbers in Roman numerals</a>

base,easy,nonn,new

Roman numerals with "i" replaced by "1", "v" replaced by "5", "x" replaced by 10, etc., sorted in increasing order.

1, 5, 10, 11, 15, 50, 51, 100, 101, 105, 110, 111, 500, 501, 505, 511, 1000, 1001, 1005, 1010, 1011, 1015, 1050, 1051, 5001, 5005, 5010, 5011, 5015, 5051, 5111, 10001, 10005, 10010, 10011, 10015, 10050, 10051, 10100, 10101, 10105, 10110, 10111

1,2

Cf. A093788.

Eric Angelini (eric.angelini(AT)kntv.be), Aug 05 2007, <a href="http://www.research.att.com/~njas/sequences/b130228.txt">Table of n, a(n) for n = 1..154</a>

Gerard Schildberger, <a href="http://www.research.att.com/~njas/sequences/a006968.txt">The first 3999 numbers in Roman numerals</a>

base,easy,nonn

Eric Angelini (eric.angelini(AT)kntv.be), Aug 05 2007

approved