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.

A353330 a(n) = A006047(A156552(n)).

This page as a plain text file.
%I A353330 #11 Apr 20 2022 15:47:02
%S A353330 1,2,3,2,4,6,9,6,3,2,12,6,12,18,4,6,12,8,36,6,3,6,16,18,4,18,12,18,81,
%T A353330 6,144,8,12,24,9,2,324,24,12,8,432,8,108,24,12,6,576,18,9,18,48,72,
%U A353330 11664,6,4,54,12,216,972,24,3888,162,12,6,36,18,1728,24,12,24,8748,6,5184,648,27,18,16,72,34992,54,4,72
%N A353330 a(n) = A006047(A156552(n)).
%H A353330 Antti Karttunen, <a href="/A353330/b353330.txt">Table of n, a(n) for n = 1..10000</a>
%H A353330 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A353330 a(n) = A006047(A156552(n)).
%o A353330 (PARI)
%o A353330 A006047(n) = { my(m=1, d); while(n, d = (n%3); m *= (1+d); n = (n-d)/3); m; };
%o A353330 A156552(n) = { my(f = factor(n), p, p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res };
%o A353330 A353330(n) = A006047(A156552(n));
%Y A353330 Cf. A006047, A156552.
%Y A353330 Cf. also A329903, A332814, A341353 and A353360.
%K A353330 nonn,look
%O A353330 1,2
%A A353330 _Antti Karttunen_, Apr 20 2022