A342464 Largest digit value when A329886(n) is written in primorial base, where A329886 is the primorial inflation of Doudna-tree.

1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 6, 4, 4, 2, 1, 2, 1, 2, 6, 4, 8, 5, 5, 3, 6, 8, 5, 4, 11, 2, 6, 1, 1, 2, 6, 4, 4, 1, 3, 1, 16, 5, 4, 3, 9, 10, 8, 3, 10, 12, 10, 6, 10, 7, 2, 3, 18, 10, 5, 4, 12, 2, 4, 2, 1, 2, 6, 4, 13, 12, 10, 8, 12, 8, 13, 2, 4, 6, 7, 2, 15, 15, 12, 10, 9, 8, 7, 6, 10, 12, 10, 9, 11, 6, 9, 6, 18, 15

Offset: 0

Author

Antti Karttunen, Mar 15 2021

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 0..16383
• Index entries for sequences related to binary expansion of n
• Index entries for sequences related to primorial base

Crossrefs

Cf. A005940, A051903, A108951, A276086, A328114, A329344, A329886, A342456, A342461, A342462.

Programs

PARI

A283980(n) = {my(f=factor(n)); prod(i=1, #f~, my(p=f[i, 1], e=f[i, 2]); if(p==2, 6, nextprime(p+1))^e)}; \\ From A283980
A329886(n) = if(n<2,1+n,if(!(n%2),A283980(A329886(n/2)),2*A329886(n\2)));
A328114(n) = { my(s=0, p=2); while(n, s = max(s,(n%p)); n = n\p; p = nextprime(1+p)); (s); };
A342464(n) = A328114(A329886(n));

Formula

a(n) = A328114(A329886(n)) = A051903(A342456(n)) = A329344(A005940(1+n)).