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.

A329374 a(1) = 0; for n > 1, a(n) = A000265(A329372(n)), where A329372 is Dirichlet convolution of the identity function with A156552.

This page as a plain text file.
%I A329374 #6 Nov 12 2019 19:21:01
%S A329374 0,1,1,5,1,3,1,17,3,11,1,11,1,5,1,49,1,61,1,39,7,19,1,33,1,71,25,17,1,
%T A329374 19,1,129,13,137,11,209,1,133,47,115,1,1,1,63,37,131,1,89,5,159,89,
%U A329374 227,1,15,5,49,85,1039,1,63,1,129,31,321,35,29,1,429,83,25,1,605,1,4115,111,409,15,101,1,307,45,8213,1,13,65,8203,655,179,1,335,25
%N A329374 a(1) = 0; for n > 1, a(n) = A000265(A329372(n)), where A329372 is Dirichlet convolution of the identity function with A156552.
%H A329374 Antti Karttunen, <a href="/A329374/b329374.txt">Table of n, a(n) for n = 1..2048</a>
%H A329374 Antti Karttunen, <a href="/A329374/a329374.txt">Data supplement: n, a(n) computed for n = 1..32768</a>
%H A329374 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A329374 a(1) = 0; and for n > 1, a(n) = A000265(A329372(n)).
%o A329374 (PARI)
%o A329374 A000265(n) = (n/2^valuation(n, 2));
%o A329374 A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));
%o A329374 A297167(n) = if(1==n, 0, (A061395(n) + (bigomega(n)-omega(n)) - 1));
%o A329374 A297112(n) = if(1==n,0,2^A297167(n));
%o A329374 A329372(n) = sumdiv(n,d,sigma(n/d)*A297112(d));
%o A329374 A329374(n) = if(1==n, 0, A000265(A329372(n)));
%Y A329374 Cf. A000265, A061395, A156552, A297112, A297167, A329372, A329373.
%K A329374 nonn
%O A329374 1,4
%A A329374 _Antti Karttunen_, Nov 12 2019