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!)
A331309 a(n) = A000005(A225546(n)), where A000005 gives the number of divisors of n. 7
1, 2, 3, 2, 5, 4, 9, 4, 3, 6, 17, 6, 33, 10, 7, 2, 65, 6, 129, 10, 11, 18, 257, 8, 5, 34, 9, 18, 513, 8, 1025, 4, 19, 66, 13, 4, 2049, 130, 35, 12, 4097, 12, 8193, 34, 15, 258, 16385, 6, 9, 10, 67, 66, 32769, 12, 21, 20, 131, 514, 65537, 14, 131073, 1026, 27, 4, 37, 20, 262145, 130, 259, 14, 524289, 8, 1048577, 2050, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = A000005(A225546(n)).
PROG
(PARI)
A048675(n) = { my(f = factor(n)); sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2; };
A331309(n) = if(1==n, 1, my(f=factor(n), u=#binary(vecmax(f[, 2])), prods=vector(u, x, 1), m=1, e); for(i=1, u, for(k=1, #f~, if(bitand(f[k, 2], m), prods[i] *= f[k, 1])); m<<=1); prod(i=1, u, 1+A048675(prods[i])));
CROSSREFS
Sequence in context: A075365 A268466 A075274 * A178144 A357987 A135737
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 21 2020
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 27 08:35 EDT 2024. Contains 375462 sequences. (Running on oeis4.)