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.

A351081 a(n) = Product_{d|n} A019565(A289813(d)); a product obtained from the 1-digits present in ternary expansions of the divisors of n.

This page as a plain text file.
%I A351081 #8 Jan 31 2022 18:11:00
%S A351081 2,2,6,12,6,6,4,12,30,60,10,540,60,60,90,120,10,30,4,360,36,60,6,540,
%T A351081 12,60,210,5040,14,18900,84,2520,210,140,84,94500,140,140,18900,75600,
%U A351081 210,18900,140,12600,3150,84,14,113400,168,2520,210,5040,14,210,60,5040,36,84,6,1701000,4,84,900,25200,900,18900
%N A351081 a(n) = Product_{d|n} A019565(A289813(d)); a product obtained from the 1-digits present in ternary expansions of the divisors of n.
%F A351081 a(n) = A019565(A289813(n)) * A293221(n).
%o A351081 (PARI)
%o A351081 A019565(n) = { my(m=1, p=1); while(n>0, p = nextprime(1+p); if(n%2, m *= p); n >>= 1); (m); };
%o A351081 A289813(n) = { my(d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==1, 1, 0)), 2); };
%o A351081 A351081(n) = { my(m=1); fordiv(n,d,m *= A019565(A289813(d))); (m); };
%Y A351081 Cf. A019565, A289813, A293221, A351082, A351091.
%K A351081 nonn,easy
%O A351081 1,1
%A A351081 _Antti Karttunen_, Jan 31 2022