login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167311 Totally multiplicative sequence with a(p) = 10*(p+2) for prime p. 1
1, 40, 50, 1600, 70, 2000, 90, 64000, 2500, 2800, 130, 80000, 150, 3600, 3500, 2560000, 190, 100000, 210, 112000, 4500, 5200, 250, 3200000, 4900, 6000, 125000, 144000, 310, 140000, 330, 102400000, 6500, 7600, 6300, 4000000, 390, 8400, 7500 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..1000

FORMULA

Multiplicative with a(p^e) = (10*(p+2))^e. If n = Product p(k)^e(k) then a(n) = Product (10*(p(k)+2))^e(k). a(n) = A165831(n) * A166590(n) = 10^bigomega(n) * A166590(n) = 10^A001222(n) * A166590(n).

MATHEMATICA

a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 2)^fi[[All, 2]])); Table[a[n]*10^PrimeOmega[n], {n, 1, 100}] (* G. C. Greubel, Jun 07 2016 *)

CROSSREFS

Sequence in context: A167327 A216305 A173337 * A039523 A217729 A255392

Adjacent sequences:  A167308 A167309 A167310 * A167312 A167313 A167314

KEYWORD

nonn,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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 23 16:10 EST 2021. Contains 340385 sequences. (Running on oeis4.)