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.

Showing 1-3 of 3 results.

A330691 a(n) = gcd(n, A309639(n)), where A309639(n) is the index of the least harmonic number H_i whose denominator (A002805) is divisible by n.

Original entry on oeis.org

1, 2, 3, 4, 5, 3, 7, 8, 9, 5, 11, 4, 13, 7, 5, 16, 17, 9, 19, 5, 3, 11, 23, 3, 25, 13, 27, 7, 29, 5, 31, 32, 11, 17, 7, 9, 37, 19, 13, 8, 41, 3, 43, 11, 9, 23, 47, 16, 49, 25, 17, 13, 53, 27, 11, 8, 19, 29, 59, 5, 61, 31, 9, 64, 13, 11, 67, 17, 3, 7, 71, 9, 73, 37, 25, 19, 11, 13, 79, 16, 81, 41, 83, 3, 17, 43, 29, 11, 89, 9
Offset: 1

Views

Author

Antti Karttunen, Dec 29 2019

Keywords

Crossrefs

Cf. A000961 (fixed points).

Programs

  • Mathematica
    A309639[n_] := For[k = 1, True, k++, If[Divisible[Denominator[ HarmonicNumber[k]], n], Return[k]]];
    a[n_] := GCD[n, A309639[n]];
    Array[a, 105]
  • PARI
    A330691(n) = gcd(n, A309639(n));

Formula

a(n) = gcd(n, A309639(n)).
a(n) = n/A330692(n).

A330692 a(n) = n / gcd(n, A309639(n)), where A309639(n) is the index of the least harmonic number H_i whose denominator (A002805) is divisible by n.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 3, 1, 1, 2, 1, 4, 7, 2, 1, 8, 1, 2, 1, 4, 1, 6, 1, 1, 3, 2, 5, 4, 1, 2, 3, 5, 1, 14, 1, 4, 5, 2, 1, 3, 1, 2, 3, 4, 1, 2, 5, 7, 3, 2, 1, 12, 1, 2, 7, 1, 5, 6, 1, 4, 23, 10, 1, 8, 1, 2, 3, 4, 7, 6, 1, 5, 1, 2, 1, 28, 5, 2, 3, 8, 1, 10, 7, 4, 3, 2, 5, 3, 1, 2, 9, 4, 1, 6, 1, 8, 35
Offset: 1

Views

Author

Antti Karttunen, Dec 29 2019

Keywords

Crossrefs

Cf. A000961 (indices of 1's).

Programs

Formula

a(n) = n/A330691(n) = n / gcd(n, A309639(n)).

A330741 a(n) = gcd(A309639(n), A319626(n)).

Original entry on oeis.org

1, 2, 3, 4, 5, 3, 7, 8, 9, 5, 11, 2, 13, 7, 5, 16, 17, 9, 19, 5, 3, 11, 23, 3, 25, 13, 27, 7, 29, 5, 31, 32, 11, 17, 7, 9, 37, 19, 13, 8, 41, 3, 43, 11, 3, 23, 47, 8, 49, 25, 17, 13, 53, 27, 11, 8, 19, 29, 59, 5, 61, 31, 9, 64, 13, 11, 67, 17, 3, 7, 71, 9, 73, 37, 25, 19, 11, 13, 79, 16, 81, 41, 83, 3, 17, 43, 29, 11, 89, 3
Offset: 1

Views

Author

Antti Karttunen, Dec 29 2019

Keywords

Crossrefs

Programs

Formula

a(n) = gcd(A309639(n), A319626(n)).
a(n) = n / A330742(n).
Showing 1-3 of 3 results.