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.

A319984 Fully multiplicative with a(p^e) = prime(p mod 4)^e.

This page as a plain text file.
%I A319984 #11 Oct 08 2018 08:08:38
%S A319984 1,3,5,9,2,15,5,27,25,6,5,45,2,15,10,81,2,75,5,18,25,15,5,135,4,6,125,
%T A319984 45,2,30,5,243,25,6,10,225,2,15,10,54,2,75,5,45,50,15,5,405,25,12,10,
%U A319984 18,2,375,10,135,25,6,5,90,2,15,125,729,4,75,5,18,25,30,5,675,2,6,20,45,25,30,5,162,625,6,5,225,4,15,10,135,2,150,10,45,25,15,10
%N A319984 Fully multiplicative with a(p^e) = prime(p mod 4)^e.
%C A319984 For all i, j:
%C A319984   A319714(i) = A319714(j) => a(i) = a(j) => A065338(i) = A065338(j).
%H A319984 Antti Karttunen, <a href="/A319984/b319984.txt">Table of n, a(n) for n = 1..10000</a>
%H A319984 Antti Karttunen, <a href="/A319984/a319984.txt">Data supplement: n, a(n) computed for n = 1..100000</a>
%F A319984 For all n, A003963(a(n)) = A065338(n).
%o A319984 (PARI) A319984(n) = { my(f=factor(n)); prod(i=1, #f~, (prime(f[i, 1]%4))^f[i, 2]); };
%Y A319984 Cf. also A065338, A319714, A319985, A319986, A319987, A320114, A320115.
%K A319984 nonn,mult
%O A319984 1,2
%A A319984 _Antti Karttunen_, Oct 06 2018