login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A166632 Totally multiplicative sequence with a(p) = 2*(p-1) for prime p. 0
1, 2, 4, 4, 8, 8, 12, 8, 16, 16, 20, 16, 24, 24, 32, 16, 32, 32, 36, 32, 48, 40, 44, 32, 64, 48, 64, 48, 56, 64, 60, 32, 80, 64, 96, 64, 72, 72, 96, 64, 80, 96, 84, 80, 128, 88, 92, 64, 144, 128 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

Multiplicative with a(p^e) = (2*(p-1))^e. If n = Product p(k)^e(k) then a(n) = Product (2*(p(k)-1)^e(k). a(n) = A061142(n) * A003958(n) = 2^bigomega(n) * A003958(n) = 2^A001222(n) * A003958(n).

CROSSREFS

Sequence in context: A076347 A140513 A188112 * A116596 A048656 A107848

Adjacent sequences:  A166629 A166630 A166631 * A166633 A166634 A166635

KEYWORD

nonn,mult

AUTHOR

Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Oct 18 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 02:51 EST 2012. Contains 205860 sequences.