Fill an n X n array with various permutations of the integers 1, 2, 3, 4... n^2. Define the organization number of the n X n array to be the following: Start at 1, count the rectilinear steps to reach 2, then the rectilinear steps to reach 3, etc. Add them up. The array that has the maximum organization number would be the "most disorganized." This sequence is the sequence showing the most disorganized number for n X n arrays starting at 1 X 1.
0, 5, 23, 61, 119, 213, 335, 509, 719, 997, 1319, 1725, 2183, 2741, 3359, 4093, 489
6 seqfan posts
Fri Aug 27 21:02:22 CEST 2010 [seqfan] Re: A179094