Voozh

A350778

Numerators of fractions n/prime(n) sorted in decreasing order.

2, 3, 4, 1, 6, 5, 8, 7, 9, 11, 10, 14, 12, 15, 13, 16, 18, 17, 21, 19, 20, 22, 23, 24, 29, 30, 27, 28, 25, 26, 34, 32, 31, 33, 36, 37, 35, 39, 38, 42, 40, 46, 41, 45, 44, 43, 47, 53, 51, 50, 52, 49, 61, 48, 54, 58, 55, 60, 59, 56, 57, 62, 66, 65, 64, 63, 67, 68, 71, 70

(list; graph; refs; listen; history; text; internal format)

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

Petr Platais, Table of n, a(n) for n = 1..10000

Petr Platais, Scatterplot of cumulative sums of signs of first differences

Rémy Sigrist, Scatterplot of the first differences of the first 100000 terms

Index entries for sequences that are permutations of the natural numbers

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