Search: a096136 -id:a096136
|
|
A096135
|
|
Triangle read by rows which contains in row n that permutation of the n numbers T(n-1)+1..T(n) which yields a smallest multiple of n after concatenation. T(n) are the triangular numbers. If no such multiple exists, the row contains zeros.
|
|
+10
1
|
|
|
1, 3, 2, 4, 5, 6, 7, 9, 10, 8, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 20, 22, 23, 24, 25, 28, 26, 27, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Conjecture: No term is zero.
|
|
LINKS
|
|
|
EXAMPLE
|
Terms a(7) to a(10) are 7,9,10,8 respectively, a permutation of 7,8,9 and 10, the next four numbers and 79108 is a multiple of 4.
The 4th row contains a permutation of 7, 8, 9 and 10, the four numbers up to and including T(4)=A000217(4)=10. The concatenations 78910, 78109 etc. are not multiples of 4, which leaves the concatenation 79108 as the only (and therefore minimal) candidate for the ordering of the numbers in the row. Triangle starts
1;
3,2;
4,5,6;
7,9,10,8;
11,12,13,14,15;
16,17,18,19,21,20;
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
Search completed in 0.007 seconds
|