The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A176166 Highest exponents of triangular numbers. 0
 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 3, 3, 2, 2, 1, 1, 1, 1, 2, 2, 2, 3, 3, 1, 1, 1, 4, 4, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 3, 3, 2, 2, 1, 1, 3, 3, 2, 2, 1, 1, 1, 1, 1, 2, 5, 5, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 3, 4, 4, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 4, 4, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS FactorInteger[6]={{2, 1}, {3, 1}},..FactorInteger[28]={{2, 2}, {7, 1}},... LINKS MATHEMATICA f1[n_]:=Max[Last/@FactorInteger[n]]; f2[n_]:=n*(n+1)/2; Table[f1[f2[n]], {n, 2, 4*5!}] CROSSREFS Cf. A000217, A005361, A135939 Sequence in context: A126061 A088496 A036602 * A167911 A037804 A316894 Adjacent sequences: A176163 A176164 A176165 * A176167 A176168 A176169 KEYWORD nonn AUTHOR Vladimir Joseph Stephan Orlovsky, Apr 10 2010 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.

Last modified December 7 10:26 EST 2022. Contains 358656 sequences. (Running on oeis4.)