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.

A351250 Numerator of n / A276086(n).

Original entry on oeis.org

0, 1, 2, 1, 4, 5, 6, 7, 8, 3, 2, 11, 12, 13, 14, 1, 16, 17, 18, 19, 4, 7, 22, 23, 24, 1, 26, 9, 28, 29, 30, 31, 32, 11, 34, 5, 36, 37, 38, 13, 8, 41, 6, 43, 44, 3, 46, 47, 48, 7, 2, 17, 52, 53, 54, 11, 8, 19, 58, 59, 60, 61, 62, 3, 64, 65, 66, 67, 68, 23, 2, 71, 72, 73, 74, 1, 76, 11, 78, 79, 16, 27, 82, 83, 12, 17
Offset: 0

Views

Author

Antti Karttunen, Feb 05 2022

Keywords

Crossrefs

Cf. A276086, A324198, A328386, A328387 (positions of ones), A351251 (denominators).
Cf. A324583 (the positions of fixed points after the zero).
Cf. also A351230.

Programs

  • Mathematica
    Array[Block[{i, m, n = #, p}, m = i = 1; While[n > 0, p = Prime[i]; m *= p^Mod[n, p]; n = Quotient[n, p]; i++]; Numerator[#/m]] &, 86, 0] (* Michael De Vlieger, Feb 06 2022 *)
  • PARI
    A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
    A351250(n) = numerator(n/A276086(n));

Formula

a(n) = n / A324198(n) = n / gcd(n, A276086(n)).
a(n) = n / gcd(n, A328386(n)).