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.
Northwest corner of array: 1 2 3 7 4 5 6 14 9 10 8 23 16 17 11 28
Array begins: n\k| 1 2 3 4 5 6 7 8 9 10 11 ---+------------------------------------------------ 0 | 1 4 9 16 25 36 49 64 81 100 121 1 | 2 5 10 17 26 37 50 65 82 101 122 2 | 3 6 8 11 12 15 18 20 24 27 30 3 | 41 130 269 370 458 697 986 1313 1325 1613 1714 4 | 7 14 23 28 32 33 34 47 55 60 62 5 | 13 29 53 74 85 89 125 173 185 218 229 6 | 19 21 22 45 52 54 57 59 70 77 88 7 | 58 73 202 250 274 314 349 425 538 761 1010 8 | 31 44 69 71 91 92 108 135 153 158 160 9 | 106 113 137 149 265 389 493 610 698 754 970 10 | 43 67 86 93 115 116 118 129 154 159 161 The least n for which CF(sqrt(n)) has period of length 4 is n=7, with CF=[2;1,1,1,4,1,1,1,4,1,1,1,4,...]; thus T(4,1)=7. [The array T(n,k) is indexed by n=0,1,2,3,..., k=1,2,3... .] Row 0 consists of squares: 1,4,9,...
Array begins: n\k| 0 1 2 3 4 5 6 7 8 9 10 ---+------------------------------------------- 1 | 1 2 3 41 7 13 19 58 31 106 43 2 | 4 5 6 130 14 29 21 73 44 113 67 3 | 9 10 8 269 23 53 22 202 69 137 86 4 | 16 17 11 370 28 74 45 250 71 149 93 5 | 25 26 12 458 32 85 52 274 91 265 115 6 | 36 37 15 697 33 89 54 314 92 389 116 7 | 49 50 18 986 34 125 57 349 108 493 118 8 | 64 65 20 1313 47 173 59 425 135 610 129 9 | 81 82 24 1325 55 185 70 538 153 698 154 10 | 100 101 27 1613 60 218 77 761 158 754 159 11 | 121 122 30 1714 62 229 88 1010 160 970 161 The least m for which CF(sqrt(m)) has period of length 4 is m=7, with CF=[2;1,1,1,4,1,1,1,4,1,1,1,4,...]; thus T(1,4)=7. [The array T(n,k) is indexed by n=1,2,3,..., k=0,1,2,3... .] Column 0 consists of squares: 1,4,9,...
Comments