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.

A324186 Sum of odd divisors permuted by A163511: a(n) = A000593(A163511(n)).

This page as a plain text file.
%I A324186 #9 Feb 19 2019 00:10:38
%S A324186 1,1,1,4,1,13,4,6,1,40,13,31,4,24,6,8,1,121,40,156,13,124,31,57,4,78,
%T A324186 24,48,6,32,8,12,1,364,121,781,40,624,156,400,13,403,124,342,31,228,
%U A324186 57,133,4,240,78,248,24,192,48,96,6,104,32,72,8,48,12,14,1,1093,364,3906,121,3124,781,2801,40,2028,624,2400,156,1600,400,1464,13,1240,403
%N A324186 Sum of odd divisors permuted by A163511: a(n) = A000593(A163511(n)).
%H A324186 Antti Karttunen, <a href="/A324186/b324186.txt">Table of n, a(n) for n = 0..16384</a>
%H A324186 Antti Karttunen, <a href="/A324186/a324186.txt">Data supplement: n, a(n) computed for n = 0..65537</a>
%F A324186 a(n) = A000593(A163511(n)).
%F A324186 For n > 0, a(n) = A324056(A054429(n)).
%o A324186 (PARI)
%o A324186 A000593(n) = sigma(n>>valuation(n, 2)); \\ From A000593
%o A324186 A163511(n) = if(!n,1,my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p));
%o A324186 A324186(n) = A000593(A163511(n));
%Y A324186 Cf. A000593, A038712, A054429, A163511, A324056, A324184.
%K A324186 nonn
%O A324186 0,4
%A A324186 _Antti Karttunen_, Feb 17 2019