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!)
A071188 Largest prime factor of number of divisors of n. 3
1, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 5, 2, 3, 2, 3, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 5, 3, 3, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 3, 7, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 3, 3, 2, 2, 2, 5, 5, 2, 2, 3, 2, 2, 2, 2, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) = A006530(A000005(n)).

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

MATHEMATICA

Max[Transpose[FactorInteger[#]][[1]]]&/@DivisorSigma[0, Range[100]] (* Harvey P. Dale, Aug 28 2013 *)

PROG

(Haskell)

a071188 = a006530 . a000005  -- Reinhard Zumkeller, Sep 04 2013

CROSSREFS

Cf. A071187, A071190.

Sequence in context: A071187 A329614 A134852 * A078545 A163105 A152235

Adjacent sequences:  A071185 A071186 A071187 * A071189 A071190 A071191

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, May 15 2002

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 11 17:59 EST 2019. Contains 329925 sequences. (Running on oeis4.)