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!)
A166650 Totally multiplicative sequence with a(p) = 10*(p+1) for prime p. 2
1, 30, 40, 900, 60, 1200, 80, 27000, 1600, 1800, 120, 36000, 140, 2400, 2400, 810000, 180, 48000, 200, 54000, 3200, 3600, 240, 1080000, 3600, 4200, 64000, 72000, 300, 72000, 320, 24300000, 4800, 5400, 4800, 1440000, 380, 6000, 5600, 1620000, 420 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Multiplicative with a(p^e) = (10*(p+1))^e. If n = Product p(k)^e(k) then a(n) = Product (10*(p(k)+1)^e(k).
a(n) = A165831(n) * A003959(n) = 10^bigomega(n) * A003959(n) = 10^A001222(n) * A003959(n).
MATHEMATICA
a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 1)^fi[[All, 2]])); Table[a[n]*10^(PrimeOmega[n]), {n, 1, 100}](* G. C. Greubel, May 21 2016 *)
f[p_, e_] := (10*(p+1))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 17 2023 *)
CROSSREFS
Sequence in context: A309306 A103250 A181638 * A275193 A225049 A043120
KEYWORD
nonn,easy,mult
AUTHOR
Jaroslav Krizek, Oct 18 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 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)