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).

This page as a plain text file.
%I A277127 #19 Oct 10 2016 02:47:36
%S A277127 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,
%T A277127 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,
%U A277127 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
%N A277127 a(n) = n - lambda(n), where lambda(n) = A002322(n).
%C A277127 Largest m < n such that b^m == b^n (mod n) for every integer b.
%H A277127 Altug Alkan, <a href="/A277127/b277127.txt">Table of n, a(n) for n = 1..10000</a>
%F A277127 a(p) = 1 for prime p.
%F A277127 a(p^2) = p prime.
%F A277127 a(n) = A051953(n) for n in A033948.
%t A277127 Table[n - CarmichaelLambda@ n, {n, 83}] (* _Michael De Vlieger_, Oct 01 2016 *)
%o A277127 (PARI) a(n) = n - lcm(znstar(n)[2]); \\ _Altug Alkan_, Oct 01 2016
%Y A277127 Cf. A002322, A033948, A051953, A276976.
%K A277127 nonn
%O A277127 1,4
%A A277127 _Thomas Ordowski_, Oct 01 2016
%E A277127 More terms from _Altug Alkan_, Oct 01 2016