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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A115354 a(n) is the smallest number representable in exactly n ways as a sum of 2 powerful(1) numbers. 2
 2, 17, 108, 153, 297, 657, 1764, 2052, 4644, 6156, 10800, 16200, 22932, 29000, 11025, 54225, 92025, 68796, 100548, 99225, 44100, 88200, 264600, 431244, 176400, 441000, 666468, 1151172, 352800, 617400, 396900, 926100, 980100, 793800, 1234800 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Here we are considering powerful numbers (first definition) A001694. Note that, by definition, 1 is powerful. LINKS Donovan Johnson, Table of n, a(n) for n = 1..120 Eric Weisstein's World of Mathematics, Powerful Number. EXAMPLE a(2)=17, since 17 = 16+1 = 8+9. MATHEMATICA pwfQ[n_] := n == 1 || Min[Transpose[FactorInteger@n][[2]]] > 1; lim=200000; pt = Select[Range[lim], pwfQ]; t = Table[0, {i, lim}]; Do[v = pt[[i]]+ pt[[j]]; If[v<=lim, t[[v]]++ ], {i, Length@pt}, {j, i}]; Table[Position[t, k][[1, 1]], {k, 22}] CROSSREFS Cf. A001694, A085252, A085253, A085254, A085255, A063274, A115355. Sequence in context: A198796 A186104 A155845 * A100274 A213785 A198158 Adjacent sequences: A115351 A115352 A115353 * A115355 A115356 A115357 KEYWORD nonn AUTHOR Giovanni Resta, Jan 21 2006 EXTENSIONS a(23)-a(35) from Donovan Johnson, Dec 07 2008 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 June 21 21:50 EDT 2024. Contains 373559 sequences. (Running on oeis4.)