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.

A345047 a(n) = A003958(n) / A345046(n), where A003958(n) is multiplicative with a(p^e) = (p-1)^e, and A345046(n) gives the least common multiple of the same factors.

This page as a plain text file.
%I A345047 #8 May 12 2024 15:35:35
%S A345047 1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,2,1,
%T A345047 2,1,1,1,2,1,1,2,1,1,4,1,1,1,1,1,2,1,1,1,2,1,2,1,1,2,1,1,2,1,4,2,1,1,
%U A345047 2,2,1,1,1,1,2,1,2,2,1,1,1,1,1,2,4,1,2,1,1,4,6,1,2,1,2,1,1,1,2,1,1,2,1,1,4
%N A345047 a(n) = A003958(n) / A345046(n), where A003958(n) is multiplicative with a(p^e) = (p-1)^e, and A345046(n) gives the least common multiple of the same factors.
%H A345047 Antti Karttunen, <a href="/A345047/b345047.txt">Table of n, a(n) for n = 1..65537</a>
%F A345047 a(n) = A003958(n) / A345046(n).
%o A345047 (PARI) A345047(n) = { my(f=factor(n)~, g=vector(#f, i, (f[1, i]-1)^f[2, i])); factorback(g)/lcm(g); };
%Y A345047 Cf. A003958, A345046.
%Y A345047 Cf. also A345045, A353784.
%K A345047 nonn
%O A345047 1,15
%A A345047 _Antti Karttunen_, Jun 07 2021