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.

A137609 Consider a line in n-space given parametrically by y(t)=v*t, where v is the vector (2,3,5,..prime(n)). Let t0>0 be the least value of t such that y(t0) is closest to an integer point not on the line y(t). a(n) is t0 times v.v.

Table of values

n a(n)
2 5
3 15
4 36
5 91
6 145
7 305
8 476
9 729
10 408
11 1295
12 1796
13 1072
14 1370
15 1749
16 2226
17 2816
18 3426
19 67
20 71
21 73
22 79
23 83
24 89
25 97
26 101
27 103
28 107
29 109
30 113
31 127
32 131
33 137
34 139
35 149
36 151
37 157
38 163
39 167
40 173
41 179
42 181
43 191
44 193
45 197
46 199
47 211
48 223
49 227
50 229

List of values

[5, 15, 36, 91, 145, 305, 476, 729, 408, 1295, 1796, 1072, 1370, 1749, 2226, 2816, 3426, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229]