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.

A366797 Number of odd divisors permuted by A163511: a(n) = A001227(A163511(n)).

This page as a plain text file.
%I A366797 #7 Oct 27 2023 13:11:37
%S A366797 1,1,1,2,1,3,2,2,1,4,3,3,2,4,2,2,1,5,4,4,3,6,3,3,2,6,4,4,2,4,2,2,1,6,
%T A366797 5,5,4,8,4,4,3,9,6,6,3,6,3,3,2,8,6,6,4,8,4,4,2,6,4,4,2,4,2,2,1,7,6,6,
%U A366797 5,10,5,5,4,12,8,8,4,8,4,4,3,12,9,9,6,12,6,6,3,9,6,6,3,6,3,3,2,10,8,8,6,12,6,6
%N A366797 Number of odd divisors permuted by A163511: a(n) = A001227(A163511(n)).
%H A366797 Antti Karttunen, <a href="/A366797/b366797.txt">Table of n, a(n) for n = 0..16384</a>
%H A366797 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A366797 a(n) = 2*A366873(n) - A324186(n).
%o A366797 (PARI)
%o A366797 A001227(n) = numdiv(n>>valuation(n, 2));
%o A366797 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 A366797 A366797(n) = A001227(A163511(n));
%Y A366797 Cf. A001227, A163511, A366798 (rgs-transform).
%Y A366797 Cf. also A324186, A366873.
%K A366797 nonn
%O A366797 0,4
%A A366797 _Antti Karttunen_, Oct 27 2023