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!)
A324910 Multiplicative with a(p^e) = (2^e)-1. 3
1, 1, 1, 3, 1, 1, 1, 7, 3, 1, 1, 3, 1, 1, 1, 15, 1, 3, 1, 3, 1, 1, 1, 7, 3, 1, 7, 3, 1, 1, 1, 31, 1, 1, 1, 9, 1, 1, 1, 7, 1, 1, 1, 3, 3, 1, 1, 15, 3, 3, 1, 3, 1, 7, 1, 7, 1, 1, 1, 3, 1, 1, 3, 63, 1, 1, 1, 3, 1, 1, 1, 21, 1, 1, 3, 3, 1, 1, 1, 15, 15, 1, 1, 3, 1, 1, 1, 7, 1, 3, 1, 3, 1, 1, 1, 31, 1, 3, 3, 9, 1, 1, 1, 7, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
Multiplicative with a(p^e) = A000225(e).
Multiplicative with a(p^e) = A322993(p^e).
a(n) = A246674(A156552(n)).
MATHEMATICA
Array[Times @@ (2^(FactorInteger[#][[All, -1]]) - 1) &, 105] (* Michael De Vlieger, Apr 14 2019 *)
PROG
(PARI) A324910(n) = factorback(apply(e -> -1+(2^e), factor(n)[, 2]~));
CROSSREFS
Sequence in context: A374126 A185587 A068845 * A257100 A152884 A360288
KEYWORD
nonn,mult
AUTHOR
Antti Karttunen, Apr 14 2019
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 July 16 04:20 EDT 2024. Contains 374343 sequences. (Running on oeis4.)