cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A383361 a(n) is the i-th smallest divisor d_i of A383360(n) for which i*d_i = A383360(n).

Original entry on oeis.org

1, 2, 5, 5, 7, 9, 7, 6, 8, 11, 13, 8, 11, 8, 17, 13, 19, 17, 23, 19, 12, 29, 23, 31, 37, 16, 29, 41, 31, 43, 47, 16, 37, 53, 20, 41, 43, 35, 59, 61, 47, 25, 67, 21, 53, 71, 73, 28, 59, 79, 20, 61, 49, 83, 89, 67, 27, 55, 28, 71, 97, 73, 101, 103, 79, 107, 65, 109
Offset: 1

Views

Author

Felix Huber, May 03 2025

Keywords

Examples

			a(8) = 6 because 6 is the 5th smallest divisor of A383360(8) = 30 = 5*6.
		

Crossrefs

Programs

  • Maple
    with(NumberTheory):
    A383360:=proc(n)
        option remember;
        local k,i,L;
        if n=1 then
            1
        else
            for k from procname(n-1)+1 do
                L:=Divisors(k);
                for i to tau(k) do
                    if L[i]*i=k then
                        return k
                    fi
                od
            od
        fi;
    end proc;
    A383361:=proc(n)
        local i,M;
        M:=Divisors(A383360(n));
        for i do
            if A383360(n)/i=M[i] then
                return M[i]
            fi
        od;
    end proc;
    seq(A383361(n),n=1..68);

Formula

a(n) = A383360(n)/A383362(n).
a(n) = A027750(A383360(n),A383362(n)).