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.

A327564 If n = Product (p_j^k_j) then a(n) = Product ((p_j + 1)^(k_j - 1)).

Original entry on oeis.org

1, 1, 1, 3, 1, 1, 1, 9, 4, 1, 1, 3, 1, 1, 1, 27, 1, 4, 1, 3, 1, 1, 1, 9, 6, 1, 16, 3, 1, 1, 1, 81, 1, 1, 1, 12, 1, 1, 1, 9, 1, 1, 1, 3, 4, 1, 1, 27, 8, 6, 1, 3, 1, 16, 1, 9, 1, 1, 1, 3, 1, 1, 4, 243, 1, 1, 1, 3, 1, 1, 1, 36, 1, 1, 6, 3, 1, 1, 1, 27, 64, 1, 1, 3, 1
Offset: 1

Views

Author

Ilya Gutkovskiy, Mar 03 2020

Keywords

Examples

			a(12) = a(2^2 * 3) = (2 + 1)^(2 - 1) * (3 + 1)^(1 - 1) = 3.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := Times @@ ((#[[1]] + 1)^(#[[2]] - 1) & /@ FactorInteger[n]); Table[a[n], {n, 1, 85}]
  • PARI
    a(n) = my(f=factor(n)); for (k=1, #f~, f[k,1]++; f[k,2]--); factorback(f); \\ Michel Marcus, Mar 03 2020

Formula

a(1) = 1; a(n) = -Sum_{d|n, dA001221(n/d) * A003557(n/d) * a(d).
a(n) = A003959(n) / A048250(n) = A003968(n) / A007947(n).
a(n) = A348038(n) * A348039(n) = A340368(n) / A173557(n). - Antti Karttunen, Oct 29 2021
Dirichlet g.f.: 1/(zeta(s-1) * Product_{p prime} (1 - 1/p^(s-1) - 1/p^s)). - Amiram Eldar, Dec 07 2023

A167344 Totally multiplicative sequence with a(p) = (p-1)*(p+1) = p^2-1 for prime p.

Original entry on oeis.org

1, 3, 8, 9, 24, 24, 48, 27, 64, 72, 120, 72, 168, 144, 192, 81, 288, 192, 360, 216, 384, 360, 528, 216, 576, 504, 512, 432, 840, 576, 960, 243, 960, 864, 1152, 576, 1368, 1080, 1344, 648, 1680, 1152, 1848, 1080, 1536, 1584, 2208, 648, 2304, 1728
Offset: 1

Views

Author

Jaroslav Krizek, Nov 01 2009

Keywords

Crossrefs

Programs

  • Mathematica
    a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 1)^fi[[All, 2]])); b[1] = 1; b[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 1)^fi[[All, 2]])); Table[a[n]*b[n], {n, 1, 100}] (* G. C. Greubel, Jun 10 2016 *)
  • PARI
    a(n) = my(f=factor(n)); for (k=1, #f~, f[k,1] = f[k,1]^2-1); factorback(f); \\ Michel Marcus, Jan 31 2021

Formula

Multiplicative with a(p^e) = ((p-1)*(p+1))^e. If n = Product p(k)^e(k) then a(n) = Product ((p(k)-1)*(p(k)+1))^e(k).
a(n) = A003958(n) * A003959(n).
Sum_{k>=1} 1/a(k) = Product_{primes p} (1 + 1/(p^2 - 2)) = 1.884261780923861906728291280746835210118330549695678826316037127832097567... - Vaclav Kotesovec, Sep 20 2020
a(n) = A340323(n) * A340368(n). - Antti Karttunen, Jan 31 2021
Sum_{k=1..n} a(k) ~ c * n^3, where c = (1/3) * Product_{p prime} (1 - 1/(p^3 - p^2 + 1)) = 0.2487962948... . - Amiram Eldar, Nov 12 2022

A340323 Multiplicative with a(p^e) = (p + 1) * (p - 1)^(e - 1).

Original entry on oeis.org

1, 3, 4, 3, 6, 12, 8, 3, 8, 18, 12, 12, 14, 24, 24, 3, 18, 24, 20, 18, 32, 36, 24, 12, 24, 42, 16, 24, 30, 72, 32, 3, 48, 54, 48, 24, 38, 60, 56, 18, 42, 96, 44, 36, 48, 72, 48, 12, 48, 72, 72, 42, 54, 48, 72, 24, 80, 90, 60, 72, 62, 96, 64, 3, 84, 144, 68, 54
Offset: 1

Views

Author

Keywords

Comments

Starting with any integer and repeatedly applying the map x -> a(x) reaches the fixed point 12 or the loop {3, 4}.

Examples

			a(2^s) = 3 for all s>0.
		

Crossrefs

Programs

  • Maple
    f:= proc(n) local  t;
      mul((t[1]+1)*(t[1]-1)^(t[2]-1),t=ifactors(n)[2])
    end proc:
    map(f, [$1..100]); # Robert Israel, Jan 07 2021
  • Mathematica
    fa[n_]:=fa[n]=FactorInteger[n];
    phi[1]=1; phi[p_, s_]:= (p + 1)*( p - 1)^(s - 1)
    phi[n_]:=Product[phi[fa[n][[i, 1]], fa[n][[i, 2]]], {i,Length[fa[n]]}];
    Array[phi, 245]
  • PARI
    A340323(n) = if(1==n,n,my(f=factor(n)); prod(i=1,#f~,(f[i,1]+1)*((f[i,1]-1)^(f[i,2]-1)))); \\ Antti Karttunen, Jan 06 2021

Formula

a(n) = A167344(n) / A340368(n) = A048250(n) * A326297(n). - Antti Karttunen, Jan 06 2021
Sum_{k=1..n} a(k) ~ c * n^2, where c = (zeta(6)/(2*zeta(2)*zeta(3))) * Product_{p prime} (1 + 2/p^2) = 0.56361239505... . - Amiram Eldar, Nov 12 2022
Showing 1-3 of 3 results.