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.

A322819 a(n) = A000593(A122111(n)).

This page as a plain text file.
%I A322819 #5 Dec 27 2018 22:05:14
%S A322819 1,1,1,4,1,4,1,6,13,4,1,6,1,4,13,8,1,24,1,6,13,4,1,8,40,4,31,6,1,24,1,
%T A322819 12,13,4,40,32,1,4,13,8,1,24,1,6,31,4,1,12,121,78,13,6,1,48,40,8,13,4,
%U A322819 1,32,1,4,31,14,40,24,1,6,13,78,1,48,1,4,124,6,121,24,1,12,57,4,1,32,40,4,13,8,1,48,121,6,13,4,40,14,1,240
%N A322819 a(n) = A000593(A122111(n)).
%H A322819 Antti Karttunen, <a href="/A322819/b322819.txt">Table of n, a(n) for n = 1..20000</a>
%H A322819 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A322819 a(n) = A000593(A122111(n)).
%o A322819 (PARI)
%o A322819 A000593(n) = sigma(n>>valuation(n, 2));
%o A322819 A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
%o A322819 A122111(n) = if(1==n,n,prime(bigomega(n))*A122111(A064989(n)));
%o A322819 A322819(n) = A000593(A122111(n));
%Y A322819 Cf. A000593, A122111, A322813.
%K A322819 nonn
%O A322819 1,4
%A A322819 _Antti Karttunen_, Dec 27 2018