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.

A333354 Minimum cost of path that starts at 1 and visits integers from 1 to n, inclusive, each at least once, where the cost to travel from a to b is LCM(a, b).

Table of values

n a(n)
1 0
2 2
3 7
4 12
5 21
6 28
7 40
8 51
9 65
10 79
11 100
12 114
13 138
14 158
15 182
16 205
17 238
18 259
19 295
20 324
21 358
22 390
23 435
24 463
25 511
26 549
27 593
28 634

List of values

[0, 2, 7, 12, 21, 28, 40, 51, 65, 79, 100, 114, 138, 158, 182, 205, 238, 259, 295, 324, 358, 390, 435, 463, 511, 549, 593, 634]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.