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-2 of 2 results.

A343390 a(n) = 1 + Product_{d|n, d < n} a(d).

Original entry on oeis.org

2, 3, 3, 7, 3, 19, 3, 43, 7, 19, 3, 2395, 3, 19, 19, 1807, 3, 2395, 3, 2395, 19, 19, 3, 246546091, 7, 19, 43, 2395, 3, 370387, 3, 3263443, 19, 19, 19, 96124306951, 3, 19, 19, 246546091, 3, 370387, 3, 2395, 2395, 19, 3, 109838449356687381331, 7, 2395, 19, 2395, 3, 246546091, 19
Offset: 1

Views

Author

Ilya Gutkovskiy, Apr 13 2021

Keywords

Crossrefs

Programs

  • Maple
    a:= proc(n) option remember;
          1+mul(a(d), d=numtheory[divisors](n) minus {n})
        end:
    seq(a(n), n=1..55);  # Alois P. Heinz, Apr 13 2021
  • Mathematica
    a[n_] := a[n] = 1 + Product[If[d < n, a[d], 1], {d, Divisors[n]}]; Table[a[n], {n, 55}]

Formula

a(p^k) = A000058(k) for p prime.

A333121 a(1) = 1; a(n+1) = Product_{d|n} (1 + a(d)).

Original entry on oeis.org

1, 2, 6, 14, 90, 182, 7686, 15374, 1383750, 19372514, 10577393190, 21154786382, 2438935322096070, 4877870644192142, 224977149851430019446, 286620888910721844775478, 396611655030211352708069066250, 793223310060422705416138132502, 8436334593920261958919014477018674175558
Offset: 1

Views

Author

Ilya Gutkovskiy, Mar 08 2020

Keywords

Crossrefs

Programs

  • Mathematica
    a[1] = 1; a[n_] := a[n] = Product[1 + a[d], {d, Divisors[n - 1]}]; Table[a[n], {n, 1, 19}]
Showing 1-2 of 2 results.