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.

A331279 a(n) = A122111(A006047(n)).

This page as a plain text file.
%I A331279 #7 Jan 13 2020 20:40:03
%S A331279 1,2,4,2,3,6,4,6,9,2,3,6,3,5,10,6,10,15,4,6,9,6,10,15,9,15,25,2,3,6,3,
%T A331279 5,10,6,10,15,3,5,10,5,7,14,10,14,21,6,10,15,10,14,21,15,21,35,4,6,9,
%U A331279 6,10,15,9,15,25,6,10,15,10,14,21,15,21,35,9,15,25,15,21,35,25,35,49,2,3,6,3,5,10,6,10,15,3,5,10,5,7
%N A331279 a(n) = A122111(A006047(n)).
%H A331279 Antti Karttunen, <a href="/A331279/b331279.txt">Table of n, a(n) for n = 0..19683</a>
%F A331279 a(n) = A122111(A006047(n)).
%F A331279 For all n >= 0, A056239(a(n)) = A053735(n).
%o A331279 (PARI)
%o A331279 A006047(n) = { my(m=1, d); while(n, d = (n%3); m *= (1+d); n = (n-d)/3); m; };
%o A331279 A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
%o A331279 A122111(n) = if(1==n,n,prime(bigomega(n))*A122111(A064989(n)));
%o A331279 A331279(n) = A122111(A006047(n));
%Y A331279 Cf. A006047, A056239, A053735, A122111.
%K A331279 nonn
%O A331279 0,2
%A A331279 _Antti Karttunen_, Jan 13 2020