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.

A365426 a(n) = A336466(A163511(n)).

This page as a plain text file.
%I A365426 #9 Sep 03 2023 18:00:53
%S A365426 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,3,1,1,1,1,1,1,1,9,1,1,1,3,1,3,3,5,1,1,
%T A365426 1,1,1,1,1,27,1,1,1,9,1,9,9,25,1,1,1,3,1,3,3,15,1,3,3,5,3,5,5,3,1,1,1,
%U A365426 1,1,1,1,81,1,1,1,27,1,27,27,125,1,1,1,9,1,9,9,75,1,9,9,25,9,25,25,9,1,1,1,3,1
%N A365426 a(n) = A336466(A163511(n)).
%H A365426 Antti Karttunen, <a href="/A365426/b365426.txt">Table of n, a(n) for n = 0..16385</a>
%F A365426 For all n >= 1, a(n) = a(2*n) = a(A000265(n)).
%o A365426 (PARI)
%o A365426 A000265(n) = (n>>valuation(n,2));
%o A365426 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 A365426 A336466(n) = { my(f=factor(n)); prod(k=1, #f~, A000265(f[k, 1]-1)^f[k, 2]); };
%o A365426 A365426(n) = A336466(A163511(n));
%Y A365426 Cf. A000265, A163511, A336466.
%Y A365426 Cf. also A365427.
%K A365426 nonn
%O A365426 0,16
%A A365426 _Antti Karttunen_, Sep 03 2023