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.

A342655 Number of prime factors (counted with multiplicity) in A156552(n).

This page as a plain text file.
%I A342655 #14 Jan 29 2022 20:14:50
%S A342655 0,1,1,2,1,3,1,2,2,4,1,5,1,2,2,6,1,7,1,3,2,8,1,3,2,2,2,9,2,10,1,2,2,3,
%T A342655 3,11,1,3,2,12,1,13,1,2,4,14,1,4,2,3,1,15,1,4,1,3,3,16,1,17,2,2,3,3,2,
%U A342655 18,2,2,1,19,2,20,2,2,2,4,2,21,1,3,2,22,3,4,3,5,4,23,3,5,2,4,4,4,2,24,2,3,2,25,3,26,1,3
%N A342655 Number of prime factors (counted with multiplicity) in A156552(n).
%H A342655 Antti Karttunen, <a href="/A342655/b342655.txt">Table of n, a(n) for n = 2..10000</a> (based on Hans Havermann's factorization of A156552)
%H A342655 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A342655 a(n) = A001222(A156552(n)).
%F A342655 a(n) = A342656(n) + A055396(n) - 1.
%F A342655 a(A003961(n)) = 1 + a(n).
%F A342655 a(A000040(n)) = n-1 for all n >= 1.
%o A342655 (PARI)
%o A342655 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 A342655 A342655(n) = bigomega(A156552(n));
%Y A342655 Cf. A001222, A003961, A055396, A156552, A342656, A342657, A350064.
%Y A342655 Cf. also A323243, A324104, A324105, A324119, A342653 (sigma, phi, tau, omega and mu similarly permuted).
%K A342655 nonn
%O A342655 2,4
%A A342655 _Antti Karttunen_, Mar 18 2021