Going around the web, I read this:

Basic - 256
.
.
.
.

Disadvantages
BASIC-256 does not support three- and N-dimensional arrays in general (N>2)

http://rosettacode.org/wiki/Category:BASIC256

I think it's a mistake to write this, since Basic-256, is a great program, and can do almost the same things as with other popular languages​​.

Informatic programmer I am not, but with my formulas for calculation of pseudovectors showed that it is possible to simulate an array of any dimension with a 1D array.

Whereupon, any language with 1D or 2D dimensions can make any size.

FreeBasic In my post, it was shown that even with 20D arrys was readily achievable.

Demonstration:

http://www.freebasic.net/forum/viewtopic.php?f=3&t=19820&p=173636#p173636

Re: Position item in an array larger than 3D
May 02, 2012 11:37
.
.
.
.
Same principle as xxxx, but using a true recursive function.
This recursive function is applicable to any number of dimensions:
(the number of dimensions is the parameter 'N')
.
.
.

This is an example, the 20 dimensions are in recursive macros, the example is degree 8.

(I get an error of too many dimensions from the compiler if I go higher than eight)

.
.
.
.

I've found the bug in my previous post.
Here's an artificial set of offsets for a position in an array of up to 20 dimensions.

::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

It is shown mathematically with my formulas if possible make over 2D arrays in Basic-256 and in any language, using pseudovectores.

Regards