|
Search: id:A035486
|
|
|
| A035486 |
|
Kimberling's expulsion array read by antidiagonals. |
|
+0
6
|
|
| 1, 2, 2, 3, 3, 4, 4, 4, 2, 6, 5, 5, 5, 2, 8, 6, 6, 6, 7, 7, 6, 7, 7, 7, 4, 9, 2, 13, 8, 8, 8, 8, 2, 11, 12, 2, 9, 9, 9, 9, 10, 9, 8, 11, 18, 10, 10, 10, 10, 6, 12, 9, 16, 17, 16, 11, 11, 11, 11, 11, 7, 14, 14, 12, 14, 23, 12, 12, 12, 12, 12, 13, 11, 6, 9, 21, 2, 13, 13, 13, 13, 13, 13, 8, 15
(list; table; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
To get next row, start with element to right of diagonal term, then take number to left of diagonal, then back to 2nd number to right, etc.
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems Number Theory, Sect E35.
C. Kimberling, Problem 1615, Crux Mathematicorum, Vol. 17 (2) 44 1991 and Vol. 18, March 1992, p. 82-83.
|
|
EXAMPLE
|
1 2 3 4 5 6 7 8 9 10...
2 3 4 5 6 7 8 9 10 11...
4 2 5 6 7 8 9 10 11 12...
6 2 7 4 8 9 10 11 12 13...
8 7 9 2 10 6 11 12 13 14...
|
|
CROSSREFS
|
Cf. A006852, A007063, A038807.
Sequence in context: A085654 A074719 A079730 this_sequence A143489 A130249 A061071
Adjacent sequences: A035483 A035484 A035485 this_sequence A035487 A035488 A035489
|
|
KEYWORD
|
nonn,tabl,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 23 1999
|
|
|
Search completed in 0.002 seconds
|
