OFFSET
1,1
COMMENTS
A permutation of the positive integers. Computation of the first n terms of the sequence requires the generation and sorting of more than n fractions; exactly how many more is an open question.
LINKS
MATHEMATICA
Take[Numerator[ReverseSort[Table[n/Prime[n], {n, 1, 100+10}]]], 100]
PROG
(Python)
from fractions import Fraction
from sympy import prime, primerange
def aupton(N, m=3): # m is safety factor
f = (Fraction(i, p) for i, p in enumerate(primerange(2, prime(m*N)), 1))
return [fn.numerator for fn in sorted(f, reverse=True)][:N]
print(aupton(100)) # Michael S. Branicky, Jan 15 2022
(PARI) lista(nn) = Vec(apply(numerator, vecsort(vector(3*nn, n, n/prime(n)), , 4)), nn); \\ Michel Marcus, Jan 17 2022
CROSSREFS
KEYWORD
nonn,easy,frac
AUTHOR
Petr Platais, Jan 15 2022
STATUS
approved