OFFSET
1,2
COMMENTS
For a definition of the fractalization process, see comments in A194959. The sequence A307081, triangular array where row n is the list of the numbers from 1 to n sorted in ascending order of f(n) = A095112(n)/n, is clearly the result of a fractalization. Let {a(n)} (this sequence) be its position function.
FORMULA
EXAMPLE
In A307081 in triangular form,
- row 8 is: 1 7 5 3 2 4 6 8
- row 9 is: 1 7 5 3 9 2 4 6 8
Row 9 is row 8 in which 9 has been inserted in position 5, so a(9) = 5.
PROG
(PARI) f(n)={my(s=0, T); T=factorint(n); for(i=1, #T[, 1], for(j=1, T[i, 2], s+=1/T[i, 1]^j)); s}
prog(n)={my(V, v, j); V=List(); for(k=1, n, v=f(k)+0.; j=setsearch(V, v, 1); if(j==0, print("err"); return, listinsert(V, v, j); print1(j, ", ")))}
CROSSREFS
KEYWORD
nonn
AUTHOR
Luc Rousseau, Mar 23 2019
STATUS
approved