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.

A366787 a(n) = A366789(A163511(n)).

This page as a plain text file.
%I A366787 #7 Oct 23 2023 20:27:56
%S A366787 1,1,1,1,1,1,1,3,1,1,1,9,1,3,3,1,1,1,1,27,1,9,9,1,1,3,3,3,3,1,1,5,1,1,
%T A366787 1,81,1,27,27,1,1,9,9,3,9,1,1,25,1,3,3,9,3,3,3,5,3,1,1,15,1,5,5,3,1,1,
%U A366787 1,243,1,81,81,1,1,27,27,3,27,1,1,125,1,9,9,9,9,3,3,25,9,1,1,75,1,25,25,9,1,3,3,27
%N A366787 a(n) = A366789(A163511(n)).
%H A366787 Antti Karttunen, <a href="/A366787/b366787.txt">Table of n, a(n) for n = 0..16383</a>
%H A366787 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%o A366787 (PARI)
%o A366787 A000265(n) = (n>>valuation(n,2));
%o A366787 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 A366787 A366789(n) = { my(f=factor(n)); prod(k=1, #f~, A000265(primepi(f[k, 1]))^f[k, 2]); };
%o A366787 A366787(n) = A366789(A163511(n));
%Y A366787 Cf. A163511, A366789, A366792.
%Y A366787 Cf. also A365426, A365427
%K A366787 nonn
%O A366787 0,8
%A A366787 _Antti Karttunen_, Oct 23 2023