|
|
A181109
|
|
Array whose rows result from iterating an algorithm that takes (1,1,1,1,...) to (1,3,5,7,...).
|
|
1
|
|
|
1, 1, 1, 1, 3, 1, 1, 5, 3, 1, 1, 7, 4, 3, 1, 1, 9, 5, 4, 3, 1, 1, 11, 7, 5, 4, 3, 1, 1, 13, 8, 7, 5, 4, 3, 1, 1, 15, 10, 9, 7, 5, 4, 3, 1, 1, 17, 11, 11, 9, 7, 5, 4, 3, 1, 1, 19, 13, 12, 11, 9, 7, 5, 4, 3, 1, 1, 21, 14, 13, 12, 11, 9, 7, 5, 4, 3, 1, 1, 23, 15, 15, 13, 13, 11, 9, 7, 5, 4, 3, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
Row 1: A000012 (constant sequence of 1's)
Row 2: A005408 (odd positive integers)
|
|
LINKS
|
|
|
FORMULA
|
To generate row n+1 from row n, let
(row n) = (s(1), s(2), s(3), ...)
(row n+1) = (t(1), t(2), t(3), ...)
Then for k=1,2,3,..., let
t(k) = least positive integer not yet in sequences t or u
u(k) = t(k) + s(k).
|
|
EXAMPLE
|
Northwest corner:
1...1...1...1...1....1...1....1....1...
1...3...5...7...9...11...13...15...17...
1...3...4...5...7...8....10...11...13...
1...3...4...5...7...9....11...12...13...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|