This site is supported by donations to The OEIS Foundation.

 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!)
 A322969 Sum of the largest exponents A025479 of the first n perfect powers > 1. 3
 2, 5, 7, 11, 13, 16, 21, 23, 25, 31, 35, 37, 39, 42, 49, 51, 53, 55, 58, 60, 65, 73, 75, 77, 80, 82, 84, 86, 88, 97, 99, 101, 105, 107, 113, 115, 117, 119, 121, 124, 134, 136, 138, 140, 144, 147, 149, 151, 153, 155, 157, 160, 162, 164, 166, 168, 179, 181, 188 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Hugo Pfoertner, Table of n, a(n) for n = 1..10000 EXAMPLE a(1) = 2 because the first perfect power 4 = 2^2, a(2) = 5: added exponent 3 from 8 = 2^3, a(3) = 7: added exponent 2 from 9 = 3^2, a(4) = 11: added largest exponent 4 from 16=2^4. MATHEMATICA Union@ Accumulate@ Table[If[Set[e, GCD @@ #[[All, -1]]] > 1, e, 0] &@ FactorInteger@ n, {n, 4, 2400}] (* Michael De Vlieger, Jan 01 2019 *) PROG (PARI) my(s=0); for(k=1, 3^7, if(j=ispower(k), print1(s+=j, ", "))) CROSSREFS Cf. A001597, A025479, A076408. Sequence in context: A189468 A004134 A191406 * A229470 A157829 A020581 Adjacent sequences:  A322966 A322967 A322968 * A322970 A322971 A322972 KEYWORD nonn AUTHOR Hugo Pfoertner, Jan 01 2019 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.

Last modified December 9 16:42 EST 2019. Contains 329879 sequences. (Running on oeis4.)