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.

A373249 a(n) = A181819(n) / gcd(n, A181819(n)), where A181819(n) is the prime shadow of n.

This page as a plain text file.
%I A373249 #9 May 30 2024 16:57:20
%S A373249 1,1,2,3,2,2,2,5,1,2,2,1,2,2,4,7,2,1,2,3,4,2,2,5,3,2,5,3,2,4,2,11,4,2,
%T A373249 4,1,2,2,4,1,2,4,2,3,2,2,2,7,3,3,4,3,2,5,4,5,4,2,2,1,2,2,2,13,4,4,2,3,
%U A373249 4,4,2,5,2,2,2,3,4,4,2,7,7,2,2,1,4,2,4,5,2,2,4,3,4,2,4,11,2,3,2,9,2,4,2,5,8
%N A373249 a(n) = A181819(n) / gcd(n, A181819(n)), where A181819(n) is the prime shadow of n.
%H A373249 Antti Karttunen, <a href="/A373249/b373249.txt">Table of n, a(n) for n = 1..65537</a>
%F A373249 a(n) = A181819(n) / A373246(n) = A181819(n) / gcd(n, A181819(n)).
%o A373249 (PARI)
%o A373249 A181819(n) = factorback(apply(e->prime(e),(factor(n)[,2])));
%o A373249 A373249(n) = { my(s=A181819(n)); s/gcd(n, s); };
%Y A373249 Cf. A181819, A373246.
%Y A373249 Cf. A325755 (positions of 1's), A353566 (their characteristic function).
%K A373249 nonn
%O A373249 1,3
%A A373249 _Antti Karttunen_, May 30 2024