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.

A069785 a(n) = A061680(n!).

Original entry on oeis.org

1, 1, 1, 1, 1, 15, 15, 3, 5, 135, 135, 99, 99, 9, 63, 21, 21, 459, 459, 135, 19, 15, 15, 15, 21, 189, 189, 585, 585, 18225, 18225, 675, 15, 135, 891, 8505, 25515, 81, 81, 7695, 7695, 1575, 1575, 4725, 6615, 40635, 40635, 945, 1215, 3645, 3645, 151875, 151875
Offset: 1

Views

Author

Labos Elemer, Apr 09 2002

Keywords

Examples

			Observe cases when consecutive terms are equal: n={1,2,3,4,6,10,...,78,80,82,88,96}.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := Module[{e = FactorInteger[n!][[;;, 2]]}, GCD[Times @@ (2*e+1), Times @@ (e+1)]]; Array[a, 100] (* Amiram Eldar, Dec 02 2023 *)
  • PARI
    a(n) = {my(e = factor(n!)[,2]); gcd(vecprod(apply(x -> 2*x+1, e)), vecprod(apply(x -> x+1, e)));} \\ Amiram Eldar, Dec 02 2023

Formula

a(n) = A061680(A000142(n)). - Amiram Eldar, Dec 02 2023