cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A251716 Array of positions of A251637(n,k) in A098550.

Original entry on oeis.org

2, 3, 4, 7, 5, 6, 8, 9, 7, 8, 20, 13, 11, 10, 10, 21, 22, 15, 13, 12, 12, 28, 23, 24, 17, 16, 17, 14, 41, 30, 25, 34, 27, 18, 19, 16, 49, 43, 32, 36, 46, 38, 26, 21, 18, 59, 51, 45, 35, 38, 66, 40, 32, 24, 20, 60, 61, 53, 47, 67, 54, 68, 42, 34, 26, 25, 77
Offset: 1

Views

Author

Reinhard Zumkeller, Dec 09 2014

Keywords

Comments

T(n,k) = A098551(A251637(n,k));
A251637(n,k) = A098550(T(n,k));
T(n,k+1) > T(n,k) + 1, according definition of A098550;
conjecture: A098550 is a permutation of the positive integers iff all integers > 1 occur exactly once.

Examples

			.   n   p |  Indices of A251637(n,k) in A098550, n = 1..25, k= 1..14
.  -------+-------------------------------------------------------------
.   1   2 |   2   4   6   8  10  12  14  16  18  20   25   27   29   31
.   2   3 |   3   5   7  10  12  17  19  21  24  26   28   31   33   37
.   3   5 |   7   9  11  13  16  18  26  32  34  36   39   45   48   50
.   4   7 |   8  13  15  17  27  38  40  42  44  58   68   70   72   74
.   5  11 |  20  22  24  34  46  66  68  73  91 100  122  124  126  128
.   6  13 |  21  23  25  36  38  54  83  95 108 120  122  139  178  185
.   7  17 |  28  30  32  35  67  70 111 115 126 141  174  183  185  218
.   8  19 |  41  43  45  47  72  82 113 123 163 166  189  201  221  248
.   9  23 |  49  51  53  56  74  93 149 157 197 228  230  244  252  304
.  10  29 |  59  61  63  96 105 121 188 198 250 259  265  314  323  387
.  11  31 |  60  62  64  98 135 179 200 207 261 263  268  335  343  402
.  12  37 |  77  79  81 118 161 193 241 253 320 348  392  400  411  413
.  13  41 |  85  87  89 146 172 208 266 278 350 358  442  451  478  553
.  14  43 |  86  88  90 148 184 210 280 286 352 369  459  487  489  561
.  15  47 |  99 101 103 109 150 199 306 344 403 406  509  516  538  616
.  16  53 | 112 114 116 131 227 295 349 381 455 470  518  574  610  704
.  17  59 | 125 127 129 219 254 305 389 439 472 511  626  640  697  717
.  18  61 | 130 132 134 136 242 258 396 445 474 531  628  654  726  795
.  19  67 | 140 142 144 147 292 307 458 463 576 581  630  740  772  871
.  20  71 | 151 153 155 287 308 397 469 501 623 636  775  815  837  932
.  21  73 | 156 158 160 162 316 399 480 532 633 686  801  839  865  952
.  22  79 | 165 167 169 289 341 418 515 545 687 690  841  855  917 1033
.  23  83 | 173 175 177 182 321 360 555 577 711 723  843  898  988 1083
.  24  89 | 192 194 196 333 382 512 585 641 771 800  933  972 1075 1155
.  25  97 | 202 204 206 211 370 426 631 695 802 844 1052 1092 1177 1266
.  ---------------------------------------------------------------------
See table A251637 for A098550(T(n,k)).
		

Crossrefs

Cf. A098550, A098551, A251637, A251237 (first row), A251553 (second row).
Cf. A251541 (first column).

Programs

  • Haskell
    seen as table read by rows:
    a251716 n k = a251716_tabl !! (n-1) !! (k-1)
    a251716_row n = a251716_tabl !! (n-1)
    a251716_tabl = map (map a098551) a251637_tabl