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.

A277127 a(n) = n - lambda(n), where lambda(n) = A002322(n).

Original entry on oeis.org

0, 1, 1, 2, 1, 4, 1, 6, 3, 6, 1, 10, 1, 8, 11, 12, 1, 12, 1, 16, 15, 12, 1, 22, 5, 14, 9, 22, 1, 26, 1, 24, 23, 18, 23, 30, 1, 20, 27, 36, 1, 36, 1, 34, 33, 24, 1, 44, 7, 30, 35, 40, 1, 36, 35, 50, 39, 30, 1, 56, 1, 32, 57, 48, 53, 56, 1, 52, 47, 58, 1, 66, 1, 38, 55, 58, 47, 66, 1, 76, 27, 42, 1
Offset: 1

Views

Author

Thomas Ordowski, Oct 01 2016

Keywords

Comments

Largest m < n such that b^m == b^n (mod n) for every integer b.

Crossrefs

Programs

  • Mathematica
    Table[n - CarmichaelLambda@ n, {n, 83}] (* Michael De Vlieger, Oct 01 2016 *)
  • PARI
    a(n) = n - lcm(znstar(n)[2]); \\ Altug Alkan, Oct 01 2016

Formula

a(p) = 1 for prime p.
a(p^2) = p prime.
a(n) = A051953(n) for n in A033948.

Extensions

More terms from Altug Alkan, Oct 01 2016