cp's OEIS Frontend

A356301 The nearest common ancestor of A000265(sigma(n)) and A000265(n) in the tree depicted in A253563.

%I A356301 #12 Sep 08 2022 14:05:46
%S A356301 1,1,1,1,3,3,1,1,3,3,3,3,7,3,3,1,3,9,5,3,1,3,3,3,5,3,3,7,3,9,1,1,3,3,
%T A356301 3,3,19,3,3,3,3,3,11,3,9,3,3,3,3,3,9,7,3,9,3,3,3,3,3,15,31,3,3,1,3,9,
%U A356301 17,3,3,3,3,9,37,3,3,5,3,21,5,3,3,3,3,3,3,3,15,3,3,45,7,3,1,3,3,3,7,3,9,5,3,9,13,3,3
%N A356301 The nearest common ancestor of A000265(sigma(n)) and A000265(n) in the tree depicted in A253563.
%H A356301 Antti Karttunen, <a href="/A356301/b356301.txt">Table of n, a(n) for n = 1..16384</a>
%H A356301 Antti Karttunen, <a href="/A356301/a356301.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A356301 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A356301 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A356301 a(n) = A356300(A161942(n), A000265(n)).
%o A356301 (PARI)
%o A356301 A000265(n) = (n>>valuation(n,2));
%o A356301 A161942(n) = A000265(sigma(n));
%o A356301 A253553(n) = if(n<=2,1,my(f=factor(n), k=#f~); if(f[k,2]>1,f[k,2]--,f[k,1] = precprime(f[k,1]-1)); factorback(f));
%o A356301 A356300sq(x,y) = if(1==x||1==y,1, my(lista=List([]), i, k=x, stemvec, stemlen, h=y); while(k>1, listput(lista,k); k = A253553(k)); stemvec = Vecrev(Vec(lista)); stemlen = #stemvec; while(1, if((i=vecsearch(stemvec,h))>0, return(stemvec[i])); h = A253553(h)));
%o A356301 A356301(n) = A356300sq(A161942(n),A000265(n));
%Y A356301 Cf. A000203, A000265, A161942, A356300, A356301, A356306, A356307, A356308.
%Y A356301 Cf. also A347879.
%Y A356301 Positions of 1's in this sequence is given by the union of A000079 and A046528.
%K A356301 nonn
%O A356301 1,5
%A A356301 _Antti Karttunen_, Aug 03 2022