login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 0
0, 2, 7, 12, 21, 28, 40, 51, 65, 79, 100, 114, 138, 158, 182, 205, 238, 259, 295, 324 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Entries n > 5 generated by independent computer programs.

LINKS

Table of n, a(n) for n=1..20.

A. Catanzaro, J. Feldman, M. Higgins, B. Kimball, H. Kirk, A. C Maravelias, and D. Sinha, LCM Optimal Paths, Girls' Angle Bulletin, Vol. 13, No. 4 (2020), 13-19.

EXAMPLE

For n = 3, the optimal path is 1, 2, 1, 3, which has cost 2 + 2 + 3 = 7.

For n = 4, the optimal path is 1, 3, 1, 2, 4, which has cost 3 + 3 + 2 + 4 = 12.

For n = 7, there are multiple optimal paths of which 1, 3, 6, 2, 4, 1, 5, 1, 7 is one and has cost 3 + 6 + 6 + 4 + 4 + 5 + 5 + 7 = 40.

For n = 20, an optimal path is 1, 11, 1, 13, 1, 17, 1, 19, 1, 7, 14, 2, 16, 8, 4, 12, 6, 18, 9, 3, 15, 5, 10, 20.

CROSSREFS

Sequence in context: A023669 A137401 A309150 * A119713 A213041 A293330

Adjacent sequences:  A333351 A333352 A333353 * A333355 A333356 A333358

KEYWORD

nonn,hard,more

AUTHOR

Richard S. Chang, May 04 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 6 00:43 EDT 2020. Contains 335475 sequences. (Running on oeis4.)