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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A166654 Totally multiplicative sequence with a(p) = 5p-1 for prime p. 2
1, 9, 14, 81, 24, 126, 34, 729, 196, 216, 54, 1134, 64, 306, 336, 6561, 84, 1764, 94, 1944, 476, 486, 114, 10206, 576, 576, 2744, 2754, 144, 3024, 154, 59049, 756, 756, 816, 15876, 184, 846, 896, 17496, 204, 4284, 214, 4374, 4704, 1026, 234, 91854, 1156 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

Multiplicative with a(p^e) = (5p-1)^e. If n = Product p(k)^e(k) then a(n) = Product (5*p(k)-1)^e(k).

MATHEMATICA

a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((5*fi[[All, 1]] - 1)^fi[[All, 2]])); Table[a[n], {n, 1, 100}] (* G. C. Greubel, May 21 2016 *)

CROSSREFS

Sequence in context: A272545 A272009 A298754 * A131224 A073920 A130119

Adjacent sequences:  A166651 A166652 A166653 * A166655 A166656 A166657

KEYWORD

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 14:37 EST 2019. Contains 329999 sequences. (Running on oeis4.)