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.

A330746 Number of values of k, 1 <= k <= n, with A017666(k) = A017666(n), where A017666(n) = n/gcd(n, sigma(n)).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 4, 1, 1, 3, 2, 1, 1, 1, 2, 1, 2, 1, 3, 1, 4, 1, 2, 1, 1, 1, 1, 3, 1, 1, 2, 1, 4, 1, 2, 1, 5, 1, 2, 1, 1, 1, 5, 1, 1, 3, 2, 1, 1, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 3, 1, 2, 3, 1, 1, 6, 4, 4, 1, 2, 4, 2, 1, 1, 1, 1, 1, 4, 1, 1, 3
Offset: 1

Views

Author

Antti Karttunen, Jan 11 2020

Keywords

Comments

Ordinal transform of A017666.

Crossrefs

A left inverse of following sequences: A007691, A159907, A245775.
Cf. also A331175.

Programs

  • PARI
    up_to = 65537;
    ordinal_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), pt); for(i=1, length(invec), if(mapisdefined(om,invec[i]), pt = mapget(om, invec[i]), pt = 0); outvec[i] = (1+pt); mapput(om,invec[i],(1+pt))); outvec; };
    A017666(n) = (n/gcd(n, sigma(n)));
    v330746 = ordinal_transform(vector(up_to, n, A017666(n)));
    A330746(n) = v330746[n];

Formula

For all n >= 1, a(A014567(n)) = 1.
For all n >= 1, a(A007691(n)) = a(A159907(n)) = a(A245775(n)) = n.