|
Search: id:A120913
|
|
|
| A120913 |
|
Triangle read by rows where t(n,m) is the (ceiling(n/m))th integer from among those positive integers not occurring earlier in the sequence. |
|
+0
2
|
|
| 1, 3, 2, 6, 5, 4, 10, 8, 9, 7, 15, 13, 12, 14, 11, 21, 18, 17, 19, 20, 16, 28, 25, 24, 23, 26, 27, 22, 36, 32, 31, 30, 33, 34, 35, 29, 45, 41, 39, 40, 38, 42, 43, 44, 37, 55, 50, 49, 48, 47, 51, 52, 53, 54, 46, 66, 61, 59, 58, 60, 57, 62, 63, 64, 65, 56, 78, 72, 70, 69, 71, 68
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
This is a self-inverse permutation of the positive integers. For fixed n, U(n,k) as defined above is a permution of 1..n. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jul 25 2006
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
FORMULA
|
T(n,k) = n(n-1)/2 + U(n,k), where U(n,k) = ceiling(n/k) if ceiling(n/ceiling(n/k)) = k, otherwise U(n,k) = k. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jul 25 2006
|
|
CROSSREFS
|
Cf. A120911.
Sequence in context: A049777 A058401 A105027 this_sequence A038722 A145522 A131968
Adjacent sequences: A120910 A120911 A120912 this_sequence A120914 A120915 A120916
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Leroy Quet Jul 15 2006
|
|
EXTENSIONS
|
More terms from Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jul 25 2006
|
|
|
Search completed in 0.002 seconds
|
