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!)
A167309 Totally multiplicative sequence with a(p) = 8*(p+2) for prime p. 1
1, 32, 40, 1024, 56, 1280, 72, 32768, 1600, 1792, 104, 40960, 120, 2304, 2240, 1048576, 152, 51200, 168, 57344, 2880, 3328, 200, 1310720, 3136, 3840, 64000, 73728, 248, 71680, 264, 33554432, 4160, 4864, 4032, 1638400, 312, 5376, 4800, 1835008, 344, 92160, 360 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Multiplicative with a(p^e) = (8*(p+2))^e. If n = Product p(k)^e(k) then a(n) = Product (8*(p(k)+2))^e(k).
a(n) = A165829(n) * A166590(n) = 8^bigomega(n) * A166590(n) = 8^A001222(n) * A166590(n).
MATHEMATICA
a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 2)^fi[[All, 2]])); Table[a[n]*8^PrimeOmega[n], {n, 1, 100}] (* G. C. Greubel, Jun 07 2016 *)
f[p_, e_] := (8*(p+2))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 19 2023 *)
CROSSREFS
Sequence in context: A326112 A363530 A240246 * A159007 A114042 A302168
KEYWORD
nonn,easy,mult
AUTHOR
Jaroslav Krizek, Nov 01 2009
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 April 25 13:25 EDT 2024. Contains 371971 sequences. (Running on oeis4.)