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.

A329885 a(n) = A051903(n) mod A002322(n), where A051903 gives the maximal prime exponent of n, and A002322 is Carmichael's lambda (also known as psi).

This page as a plain text file.
%I A329885 #13 Dec 11 2019 09:51:40
%S A329885 0,0,1,0,1,1,1,1,2,1,1,0,1,1,1,0,1,2,1,2,1,1,1,1,2,1,3,2,1,1,1,5,1,1,
%T A329885 1,2,1,1,1,3,1,1,1,2,2,1,1,0,2,2,1,2,1,3,1,3,1,1,1,2,1,1,2,6,1,1,1,2,
%U A329885 1,1,1,3,1,1,2,2,1,1,1,0,4,1,1,2,1,1,1,3,1,2,1,2,1,1,1,5,1,2,2,2,1,1,1,3,1
%N A329885 a(n) = A051903(n) mod A002322(n), where A051903 gives the maximal prime exponent of n, and A002322 is Carmichael's lambda (also known as psi).
%C A329885 This differs from A051903 at n = 2, 4, 8, 12, 16, 24, 48, 80, 240. Are there any other such n? (None other found <= 201326592.)
%H A329885 Antti Karttunen, <a href="/A329885/b329885.txt">Table of n, a(n) for n = 1..65537</a>
%o A329885 (PARI)
%o A329885 A002322(n) = lcm(znstar(n)[2]); \\ From A002322
%o A329885 A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
%o A329885 A329885(n) = (A051903(n)%A002322(n));
%Y A329885 Cf. A002322, A051903, A327295.
%K A329885 nonn
%O A329885 1,9
%A A329885 _Antti Karttunen_, Dec 11 2019