[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A365427 a(n) = A336467(A163511(n)). 5
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, 3, 1, 1, 1, 81, 1, 27, 27, 1, 1, 9, 9, 3, 9, 1, 1, 9, 1, 3, 3, 9, 3, 3, 3, 3, 3, 1, 1, 9, 1, 3, 3, 7, 1, 1, 1, 243, 1, 81, 81, 1, 1, 27, 27, 3, 27, 1, 1, 27, 1, 9, 9, 9, 9, 3, 3, 9, 9, 1, 1, 27, 1, 9, 9, 49, 1, 3, 3, 27, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
Antti Karttunen, Table of n, a(n) for n = 0..16385
FORMULA
For all n >= 1, a(n) = a(2*n) = a(A000265(n)).
PROG
(PARI)
A000265(n) = (n>>valuation(n, 2));
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));
A336467(n) = { my(f=factor(n)); prod(k=1, #f~, if(2==f[k, 1], 1, (A000265(f[k, 1]+1))^f[k, 2])); };
A365427(n) = A336467(A163511(n));
CROSSREFS
Cf. A000265, A163511, A336467.
Cf. also A365426.
Sequence in context: A263159 A229142 A156535 * A366787 A348038 A327564
Adjacent sequences: A365424 A365425 A365426 * A365428 A365429 A365430
KEYWORD
nonn
AUTHOR
Antti Karttunen, Sep 03 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 11:15 EDT 2024. Contains 375512 sequences. (Running on oeis4.)