OFFSET
1,2
COMMENTS
LINKS
Clark Kimberling, Doubly interspersed sequences, double interspersions and fractal sequences, The Fibonacci Quarterly 48 (2010) 13-20.
FORMULA
Let S(n,k) denote the k-th term in the n-th row. Four cases:
S(1,k)=k^2+k-1
S(2,k)=k^2+k
if n>1 is odd, then S(n,k)=k^2+(n-1)k+(n-1)(n-3)/4
if n>2 is even, then S(n,k)= k^2+(n-1)k+n(n-4)/4.
EXAMPLE
Corner:
1....5...11...19
2....6...12...20
3....8...15...24
4...10...18...28
The double interspersion A161179 begins thus:
1....4....7...12...17...24
2....3....8...11...18...23
5....6...13...16...25...30
9...10...19...22...33...38
Expel the odd-numbered columns and then swap rows 1 and 2, leaving
3....11...23...39
4....12...24...40
6....16...30...48
10...22...38...58
Then replace each of those numbers by its rank when all the numbers are jointly ranked.
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Jul 24 2009
STATUS
approved