|
| |
|
|
A026098
|
|
Triangular array T read by rows: T(1,1)=1, T(2,1)=3, T(2,2)=2; for n >= 3, T(n,1)=p(n) and for k=2,3,...,n, T(n,k) = m*p(n+1-k), where m is the least positive integer such that q*p(n+1-k) is not any T(i,j) for 1<=i<=n-1 nor any T(n,j) for j<=k-1.
|
|
7
| |
|
|
1, 3, 2, 5, 6, 4, 7, 10, 9, 8, 11, 14, 15, 12, 16, 13, 22, 21, 20, 18, 24, 17, 26, 33, 28, 25, 27, 30, 19, 34, 39, 44, 35, 40, 36, 32, 23, 38, 51, 52, 55, 42, 45, 48, 46, 29, 69, 57, 68, 65, 66, 49, 50, 54, 56, 31, 58, 92, 76, 85, 78, 77, 63, 60, 72, 62, 37, 93, 87, 115, 95
(list; table; graph; refs; listen; history; internal format)
|
| |
| |
|
|
