|
|
A124172
|
|
Triangle in which row n contains values from 1 to n in alphabetical order (in English).
|
|
1
|
|
|
1, 1, 2, 1, 3, 2, 4, 1, 3, 2, 5, 4, 1, 3, 2, 5, 4, 1, 6, 3, 2, 5, 4, 1, 7, 6, 3, 2, 8, 5, 4, 1, 7, 6, 3, 2, 8, 5, 4, 9, 1, 7, 6, 3, 2, 8, 5, 4, 9, 1, 7, 6, 10, 3, 2, 8, 11, 5, 4, 9, 1, 7, 6, 10, 3, 2, 8, 11, 5, 4, 9, 1, 7, 6, 10, 3, 12, 2, 8, 11, 5, 4, 9, 1, 7, 6, 10, 13, 3, 12, 2
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
This is a fractal sequence: if the first instance of each number is deleted, the original sequence is recovered. - Franklin T. Adams-Watters, Nov 24 2013
While it is unlikely to ever make a practical difference, for the sake of definiteness we specify that standard American number names are to be used. - Franklin T. Adams-Watters, Nov 24 2013
For 100th row, "one"=50th value and "one hundred"=51st value, placing the extremes in the center. - Peter Woodward, Jun 27 2015
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1,
1,2,
1,3,2,
4,1,3,2
5,4,1,3,2
5,4,1,6,3,2,
...
|
|
MATHEMATICA
|
names = {"one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten", "eleven", "twelve", "thirteen"}; Flatten[Table[Table[Position[names, Sort[Take[names, n]][[i]], 1, 1][[1, 1]], {i, n}], {n, Length[names]}]] (* T. D. Noe, Nov 25 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|