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.

A260588 Number of prime factors, counted with multiplicity, of A173426(n) = concatenation of (1, 2, ..., n, n-1, ..., 1).

This page as a plain text file.
%I A260588 #22 Mar 05 2020 03:24:57
%S A260588 0,2,4,4,4,10,4,8,8,1,2,5,3,6,7,4,5,8,6,2,6,3,4,9,2,6,11,2,4,10,4,9,8,
%T A260588 6,6,12,3,6,8,4,6,7,3,6
%N A260588 Number of prime factors, counted with multiplicity, of A173426(n) = concatenation of (1, 2, ..., n, n-1, ..., 1).
%H A260588 FactorDB, <a href="http://factordb.com/index.php?query=%28121*10%5E%284*n-19%29+-+1002*10%5E%284*n-28%29+-+2*10%5E%282*n-9%29+%2B+879*10%5E10+%2B+121%29%2F99%5E2&amp;perpage=60">(121*10^(4*n-19) - 1002*10^(4*n-28) - 2*10^(2*n-9) + 879*10^10 + 121)/99^2</a>.
%F A260588 a(n) = A001222(A173426(n)).
%e A260588 a(2) = 2 since A173426(2) = 121 = 11*11 has twice the factor 11.
%e A260588 a(21) = 6 since A173426(21) = 3 * 3 * 7 * 828703 * 94364768151913037621 * 250591098443370396365457961250972909.
%o A260588 (PARI) a(n)=bigomega(A173426(n))
%Y A260588 See A260587 for the variant where only distinct prime factors are counted.
%Y A260588 See also A075023 and A075024 for the smallest and largest prime factor of the terms.
%Y A260588 Cf. A001222.
%K A260588 nonn,base,hard,more
%O A260588 1,2
%A A260588 _M. F. Hasler_, Jul 29 2015
%E A260588 Terms beyond a(30) via factorization results by _Serge Batalov_, added by _M. F. Hasler_, Jul 30 2015
%E A260588 a(38)-a(44) added using factordb.com by _Jinyuan Wang_, Mar 05 2020