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.

A166652 Totally multiplicative sequence with a(p) = 3p-1 for prime p.

Original entry on oeis.org

1, 5, 8, 25, 14, 40, 20, 125, 64, 70, 32, 200, 38, 100, 112, 625, 50, 320, 56, 350, 160, 160, 68, 1000, 196, 190, 512, 500, 86, 560, 92, 3125, 256, 250, 280, 1600, 110, 280, 304, 1750, 122, 800, 128, 800, 896, 340, 140, 5000, 400, 980
Offset: 1

Views

Author

Jaroslav Krizek, Oct 18 2009

Keywords

Programs

  • Mathematica
    a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((3*fi[[All, 1]] - 1)^fi[[All, 2]])); Table[a[n], {n, 1, 100}] (* G. C. Greubel, May 21 2016 *)

Formula

Multiplicative with a(p^e) = (3p-1)^e. If n = Product p(k)^e(k) then a(n) = Product (3*p(k)-1)^e(k).