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.

User: Ben Polson

Ben Polson's wiki page.

Ben Polson has authored 2 sequences.

A351436 a(n) = n - A351168(n).

Original entry on oeis.org

0, 1, 1, 3, 1, 2, 1, 7, 5, 2, 1, 4, 1, 2, 3, 15, 1, 10, 1, 4, 3, 2, 1, 8, 9, 2, 19, 4, 1, 6, 1, 31, 3, 2, 5, 20, 1, 2, 3, 8, 1, 6, 1, 4, 9, 2, 1, 16, 13, 18, 3, 4, 1, 38, 5, 8, 3, 2, 1, 12, 1, 2, 9, 63, 5, 6, 1, 4, 3, 10, 1, 40, 1, 2, 27, 4, 7, 6, 1, 16, 65, 2
Offset: 1

Views

Author

Ben Polson, Feb 11 2022

Keywords

Crossrefs

Cf. A351168, A006530 (largest prime factor), A071178 (exponent).

Programs

  • Mathematica
    a[n_] := n - Module[{f = FactorInteger[n]}, n*(1 - 1/f[[-1, 1]])^f[[-1, 2]]]; a[1] = 0; Table[a[n], {n, 2, 83}] (* Robert P. P. McKone, Feb 11 2022, from Amiram Eldar in A351168 *)

Formula

a(n) = n * (1 - ((A006530(n) - 1)/A006530(n))^A071178).

A351168 If n = p_1^e_1 * ... * p_k^e_k, where p_1 < ... < p_k are primes, then a(n) is obtained by replacing the last factor p_k^e_k by (p_k - 1)^e_k; a(1) = 1.

Original entry on oeis.org

1, 1, 2, 1, 4, 4, 6, 1, 4, 8, 10, 8, 12, 12, 12, 1, 16, 8, 18, 16, 18, 20, 22, 16, 16, 24, 8, 24, 28, 24, 30, 1, 30, 32, 30, 16, 36, 36, 36, 32, 40, 36, 42, 40, 36, 44, 46, 32, 36, 32, 48, 48, 52, 16, 50, 48, 54, 56, 58, 48, 60, 60, 54, 1, 60, 60, 66, 64, 66, 60, 70, 32, 72, 72, 48
Offset: 1

Views

Author

Ben Polson, Feb 03 2022

Keywords

Comments

First time a term appears four or more times in a row is when n = 1684.

Examples

			The prime factorization of 44 is 2^2 * 11^1, so a(44) = 2^2 * 10^1 = 40.
The prime factorization of 50 is 2^1 * 5^2, so a(50) = 2^1 * 4^2 = 32.

Links

Crossrefs

Cf. A006530 (greatest prime), A071178 (its exponent).
Cf. A171462 (one instance of the decrement), A003958 (all primes decremented), A351419, A351425.

Programs

  • Mathematica
    a[n_] := Module[{f = FactorInteger[n]}, n*(1 - 1/f[[-1, 1]])^f[[-1, 2]]]; a[1] = 1; Array[a, 100] (* Amiram Eldar, Feb 04 2022 *)
  • PARI
    a(n) = my(f=factor(n),r=matsize(f)[1]); if(r, f[r,1]--); factorback(f); \\ Kevin Ryde, Feb 03 2022

Formula

a(n) = n*(1 - 1/p_k)^e_k where prime factorization n = p_1^e_1 * ... * p_k^e_k with ascending p_1 < ... < p_k.
a(n) = n*(1 - 1/A006530(n))^A071178(n).

Extensions

a(1) = 1 prepended by Michel Marcus, Feb 04 2022
Edited by N. J. A. Sloane, Feb 11 2022

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

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