OFFSET
1,2
COMMENTS
For details of the construction see [Mazet & Saias].
This sequence is also a "chain": a(n) is either a divisor or a multiple of a(n+1).
Another instance of a "permutation-chain" is: A064736.
LINKS
Michel Marcus, Table of n, a(n) for n = 1..5168 (for 26 iterations)
Y.-G. Chen and C.-S. Ji, The permutation of integers with small least common multiple of two subsequent terms, Acta Math. Hungarica 132(2011), 307-309.
P. Erdős, R. Freud, and N. Hegyvári, Arithmetical properties of permutations of integers, Acta Mathematica Hungarica 41:1-2 (1983), pp 169-176.
Michel Marcus, PARI scripts
Pierre Mazet, Eric Saias, Etude du graphe divisoriel 4, arXiv:1803.10073 [math.NT], 2018.
G. Tenenbaum, Sur un problème de crible et ses applications, Annales scientifiques de l'École Normale Supérieure, 4ème série, tome 19, n°1, (1986), p.1-30.
G. Tenenbaum, Sur un problème de crible et ses applications. II. Corrigendum et étude du graphe divisoriel, Annales scientifiques de l'École Normale Supérieure, Série 4 : Tome 28 (1995) no. 2 , p. 115-127.
PROG
(PARI) See links.
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, Apr 06 2018
STATUS
approved