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

A003959 If n = Product p(k)^e(k) then a(n) = Product (p(k)+1)^e(k), a(1) = 1.

Original entry on oeis.org

1, 3, 4, 9, 6, 12, 8, 27, 16, 18, 12, 36, 14, 24, 24, 81, 18, 48, 20, 54, 32, 36, 24, 108, 36, 42, 64, 72, 30, 72, 32, 243, 48, 54, 48, 144, 38, 60, 56, 162, 42, 96, 44, 108, 96, 72, 48, 324, 64, 108, 72, 126, 54, 192, 72, 216, 80, 90, 60, 216, 62, 96, 128, 729, 84, 144, 68
Offset: 1

Views

Author

Marc LeBrun

Keywords

Comments

Completely multiplicative.
Sum of divisors of n with multiplicity. If n = p^m, the number of ways to make p^k as a divisor of n is C(m,k); and sum(C(m,k)*p^k) = (p+1)^k. The rest follows because the function is multiplicative. - Franklin T. Adams-Watters, Jan 25 2010

Links

Crossrefs

Apart from initial terms, same as A064478.
Cf. A003958, A027746, A036987, A061142, A163407.
Cf. A063441, A165824, A165825, A165826, A165827.
Cf. A165828, A165829, A165831, A167350, A166590.
Cf. A166642, A166643, A166644, A166645, A166646.
Cf. A166647, A166649, A166650, A166586, A165830.
Cf. A167351, A168065, A168066.

Programs

  • Haskell
    a003959 1 = 1
a003959 n = product $ map (+ 1) $ a027746_row n
-- Reinhard Zumkeller, Apr 09 2012
  • Maple
    a:= n-> mul((i[1]+1)^i[2], i=ifactors(n)[2]):
seq(a(n), n=1..80);  # Alois P. Heinz, Sep 13 2017
  • Mathematica
    a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]]+1)^fi[[All, 2]])); a /@ Range[67] (* Jean-François Alcover, Apr 22 2011 *)
  • PARI
    a(n)=if(n<1,0,direuler(p=2,n,1/(1-X-p*X))[n]) /* Ralf Stephan */

Formula

Multiplicative with a(p^e) = (p+1)^e. - David W. Wilson, Aug 01 2001
Sum_{n>0} a(n)/n^s = Product_{p prime} 1/(1-p^(-s)-p^(1-s)) (conjectured). - Ralf Stephan, Jul 07 2013
This follows from the absolute convergence of the sum (compare with a(n) = n^2) and the Euler product for completely multiplicative functions. Convergence occurs for at least Re(s)>3. - Thomas Anton, Jul 15 2021
Sum_{k=1..n} a(k) ~ c * n^2, where c = A065488/2 = 1/(2*A005596) = 1.3370563627850107544802059152227440187511993141988459926... - Vaclav Kotesovec, Jul 17 2021
From Thomas Scheuerle, Jul 19 2021: (Start)
a(n) = gcd(A166642(n), A166643(n)).
a(n) = A166642(n)/A061142(n).
a(n) = A166643(n)/A165824(n).
a(n) = A166644(n)/A165825(n).
a(n) = A166645(n)/A165826(n).
a(n) = A166646(n)/A165827(n).
a(n) = A166647(n)/A165828(n).
a(n) = A166649(n)/A165830(n).
a(n) = A166650(n)/A165831(n).
a(n) = A167351(n)/A166590(n). (End)
Dirichlet g.f.: zeta(s-1) * Product_{primes p} (1 + 1/(p^s - p - 1)). - Vaclav Kotesovec, Aug 22 2021

Extensions

Definition reedited (with formula) by Daniel Forgues, Nov 17 2009

A166646 Totally multiplicative sequence with a(p) = 6*(p+1) for prime p.

Original entry on oeis.org

1, 18, 24, 324, 36, 432, 48, 5832, 576, 648, 72, 7776, 84, 864, 864, 104976, 108, 10368, 120, 11664, 1152, 1296, 144, 139968, 1296, 1512, 13824, 15552, 180, 15552, 192, 1889568, 1728, 1944, 1728, 186624, 228, 2160, 2016, 209952, 252, 20736, 264, 23328
Offset: 1

Views

Author

Jaroslav Krizek, Oct 18 2009

Keywords

Links

Crossrefs

Cf. A001222, A003959, A165827.

Programs

  • Mathematica
    a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 1)^fi[[All, 2]])); Table[a[n]*6^(PrimeOmega[n]), {n, 1, 100}] (* G. C. Greubel, May 20 2016 *)
f[p_, e_] := (6*(p+1))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 18 2023 *)
  • PARI
    a(n) = {my(f = factor(n)); for (k=1, #f~, f[k,1] = 6*(f[k,1]+1)); factorback(f);} \\ Michel Marcus, May 21 2016

Formula

Multiplicative with a(p^e) = (6*(p+1))^e. If n = Product p(k)^e(k) then a(n) = Product (6*(p(k)+1))^e(k).
a(n) = A165827(n) * A003959(n) = 6^bigomega(n) * A003959(n) = 6^A001222(n) * A003959(n).

A166627 Totally multiplicative sequence with a(p) = 6p for prime p.

Original entry on oeis.org

1, 12, 18, 144, 30, 216, 42, 1728, 324, 360, 66, 2592, 78, 504, 540, 20736, 102, 3888, 114, 4320, 756, 792, 138, 31104, 900, 936, 5832, 6048, 174, 6480, 186, 248832, 1188, 1224, 1260, 46656, 222, 1368, 1404, 51840, 246, 9072, 258, 9504, 9720, 1656, 282
Offset: 1

Views

Author

Jaroslav Krizek, Oct 18 2009

Keywords

Links

Crossrefs

Cf. A001222, A165827.

Programs

  • Mathematica
    Table[n*6^PrimeOmega[n], {n, 1, 100}] (* G. C. Greubel, May 19 2016 *)
  • PARI
    a(n) = n*6^bigomega(n); \\ Michel Marcus, May 19 2016

Formula

Multiplicative with a(p^e) = (6p)^e.
If n = Product p(k)^e(k) then a(n) = Product (6*p(k))^e(k).
a(n) = n * A165827(n) = n * 6^bigomega(n) = n * 6^A001222(n).
Dirichlet g.f.: Product_{p prime} 1 / (1 - 6 * p^(1 - s)). - Ilya Gutkovskiy, Oct 30 2019

A166636 Totally multiplicative sequence with a(p) = 6*(p-1) for prime p.

Original entry on oeis.org

1, 6, 12, 36, 24, 72, 36, 216, 144, 144, 60, 432, 72, 216, 288, 1296, 96, 864, 108, 864, 432, 360, 132, 2592, 576, 432, 1728, 1296, 168, 1728, 180, 7776, 720, 576, 864, 5184, 216, 648, 864, 5184, 240, 2592, 252, 2160, 3456, 792, 276, 15552, 1296, 3456
Offset: 1

Views

Author

Jaroslav Krizek, Oct 18 2009

Keywords

Links

Crossrefs

Cf. A001222, A003958, A165827.

Programs

  • Mathematica
    DirichletInverse[f_][1] = 1/f[1]; DirichletInverse[f_][n_] :=
DirichletInverse[f][n] = -1/f[1]*Sum[f[n/d]*DirichletInverse[f][d], {d, Most[Divisors[n]]}]; muphi[n_] := MoebiusMu[n]*EulerPhi[n]; a[m_] := DirichletInverse[muphi][m]; Table[a[m]*6^(PrimeOmega[m]), {m, 1, 100}] (* G. C. Greubel, May 20 2016 *)
f[p_, e_] := (6*(p-1))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 17 2023 *)

Formula

Multiplicative with a(p^e) = (6*(p-1))^e. If n = Product p(k)^e(k) then a(n) = Product (6*(p(k)-1))^e(k).
a(n) = A165827(n) * A003958(n) = 6^bigomega(n) * A003958(n) = 6^A001222(n) * A003958(n).

A167298 Totally multiplicative sequence with a(p) = 6*(p-2) for prime p.

Original entry on oeis.org

1, 0, 6, 0, 18, 0, 30, 0, 36, 0, 54, 0, 66, 0, 108, 0, 90, 0, 102, 0, 180, 0, 126, 0, 324, 0, 216, 0, 162, 0, 174, 0, 324, 0, 540, 0, 210, 0, 396, 0, 234, 0, 246, 0, 648, 0, 270, 0, 900, 0, 540, 0, 306, 0, 972, 0, 612, 0, 342, 0, 354, 0, 1080, 0, 1188, 0, 390
Offset: 1

Views

Author

Jaroslav Krizek, Nov 01 2009

Keywords

Links

Crossrefs

Cf. A001222, A165827, A166586.

Programs

  • Mathematica
    a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 2)^fi[[All, 2]])); Table[a[n]*6^PrimeOmega[n], {n, 1, 100}] (* G. C. Greubel, Jun 07 2016 *)
f[p_, e_] := (6*(p-2))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 28 2023 *)

Formula

Multiplicative with a(p^e) = (6*(p-2))^e. If n = Product p(k)^e(k) then a(n) = Product (6*(p(k)-2))^e(k).
a(2k) = 0 for k >= 1.
a(n) = A165827(n) * A166586(n) = 6^bigomega(n) * A166586(n) = 6^A001222(n) * A166586(n).

A167307 Totally multiplicative sequence with a(p) = 6*(p+2) for prime p.

Original entry on oeis.org

1, 24, 30, 576, 42, 720, 54, 13824, 900, 1008, 78, 17280, 90, 1296, 1260, 331776, 114, 21600, 126, 24192, 1620, 1872, 150, 414720, 1764, 2160, 27000, 31104, 186, 30240, 198, 7962624, 2340, 2736, 2268, 518400, 234, 3024, 2700, 580608, 258, 38880, 270
Offset: 1

Views

Author

Jaroslav Krizek, Nov 01 2009

Keywords

Links

Crossrefs

Cf. A001222, A165827, A166590.

Programs

  • Mathematica
    a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 2)^fi[[All, 2]])); Table[a[n]*6^PrimeOmega[n], {n, 1, 100}] (* G. C. Greubel, Jun 07 2016 *)
f[p_, e_] := (6*(p+2))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 19 2023 *)

Formula

Multiplicative with a(p^e) = (6*(p+2))^e. If n = Product p(k)^e(k) then a(n) = Product (6*(p(k)+2))^e(k).
a(n) = A165827(n) * A166590(n) = 6^bigomega(n) * A166590(n) = 6^A001222(n) * A166590(n).

A167316 Totally multiplicative sequence with a(p) = 6*(p-3) for prime p.

Original entry on oeis.org

1, -6, 0, 36, 12, 0, 24, -216, 0, -72, 48, 0, 60, -144, 0, 1296, 84, 0, 96, 432, 0, -288, 120, 0, 144, -360, 0, 864, 156, 0, 168, -7776, 0, -504, 288, 0, 204, -576, 0, -2592, 228, 0, 240, 1728, 0, -720, 264, 0, 576, -864, 0, 2160, 300, 0, 576, -5184, 0, -936, 336
Offset: 1

Views

Author

Jaroslav Krizek, Nov 01 2009

Keywords

Links

Crossrefs

Cf. A001222, A165827, A166589.

Programs

  • Mathematica
    a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 3)^fi[[All, 2]])); Table[a[n]*6^PrimeOmega[n], {n, 1, 100}] (* G. C. Greubel, Jun 09 2016 *)
f[p_, e_] := (6*(p-3))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 22 2023 *)

Formula

Multiplicative with a(p^e) = (6*(p-3))^e. If n = Product p(k)^e(k) then a(n) = Product (6*(p(k)-3))^e(k).
a(3k) = 0 for k >= 1.
a(n) = A165827(n) * A166589(n) = 6^bigomega(n) * A166589(n) = 6^A001222(n) * A166589(n).

A167325 Totally multiplicative sequence with a(p) = 6*(p+3) for prime p.

Original entry on oeis.org

1, 30, 36, 900, 48, 1080, 60, 27000, 1296, 1440, 84, 32400, 96, 1800, 1728, 810000, 120, 38880, 132, 43200, 2160, 2520, 156, 972000, 2304, 2880, 46656, 54000, 192, 51840, 204, 24300000, 3024, 3600, 2880, 1166400, 240, 3960, 3456, 1296000, 264, 64800, 276, 75600
Offset: 1

Views

Author

Jaroslav Krizek, Nov 01 2009

Keywords

Links

Crossrefs

Cf. A001222, A165827, A166591.

Programs

  • Mathematica
    a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 3)^fi[[All, 2]])); Table[a[n]*6^PrimeOmega[n], {n, 1, 100}] (* G. C. Greubel, Jun 09 2016 *)
f[p_, e_] := (6*(p+3))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 21 2023 *)

Formula

Multiplicative with a(p^e) = (6*(p+3))^e. If n = Product p(k)^e(k) then a(n) = Product (6*(p(k)+3))^e(k).
a(n) = A165827(n) * A166591(n) = 6^bigomega(n) * A166591(n) = 6^A001222(n) * A166591(n).
Showing 1-8 of 8 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.