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.

A319985 Fully multiplicative with a(p^e) = prime(p mod 12)^e.

This page as a plain text file.
%I A319985 #10 Oct 08 2018 08:08:48
%S A319985 1,3,5,9,11,15,17,27,25,33,31,45,2,51,55,81,11,75,17,99,85,93,31,135,
%T A319985 121,6,125,153,11,165,17,243,155,33,187,225,2,51,10,297,11,255,17,279,
%U A319985 275,93,31,405,289,363,55,18,11,375,341,459,85,33,31,495,2,51,425,729,22,465,17,99,155,561,31,675,2,6,605,153,527,30,17
%N A319985 Fully multiplicative with a(p^e) = prime(p mod 12)^e.
%C A319985 For all i, j:
%C A319985   a(i) = a(j) => A319984(i) = A319984(j).
%C A319985   a(i) = a(j) => A319986(i) = A319986(j).
%H A319985 Antti Karttunen, <a href="/A319985/b319985.txt">Table of n, a(n) for n = 1..10000</a>
%H A319985 Antti Karttunen, <a href="/A319985/a319985.txt">Data supplement: n, a(n) computed for n = 1..100000</a>
%o A319985 (PARI) A319985(n) = { my(f=factor(n)); prod(i=1, #f~, (prime(f[i, 1]%12))^f[i, 2]); };
%Y A319985 Cf. A319984, A319986, A319987.
%K A319985 nonn,mult
%O A319985 1,2
%A A319985 _Antti Karttunen_, Oct 06 2018