login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A356307
The nearest common ancestor of A161942(n) and gcd(A000265(n), sigma(n)) in the A253563-tree.
5
1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 7, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 7, 1, 1, 3, 1, 1, 9, 7, 1, 1, 1, 3, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3
OFFSET
1,6
FORMULA
a(n) = A356300(A161942(n), A355931(n)) = A356300(A161942(n), gcd(n, A161942(n))).
PROG
(PARI)
A000265(n) = (n>>valuation(n, 2));
A161942(n) = A000265(sigma(n));
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));
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)));
A356307(n) = A356300sq(A161942(n), gcd(n, A161942(n)));
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Aug 04 2022
STATUS
approved