This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A282570 Number of ways to write n as an ordered sum of two multiplicatively perfect numbers (A007422). 1
 0, 0, 1, 0, 0, 0, 0, 2, 0, 2, 0, 2, 1, 0, 2, 2, 5, 0, 2, 0, 3, 2, 4, 4, 2, 2, 0, 4, 5, 4, 3, 2, 4, 2, 4, 6, 8, 4, 0, 4, 6, 8, 5, 6, 5, 4, 2, 8, 10, 8, 2, 0, 7, 6, 7, 4, 8, 4, 2, 8, 10, 12, 2, 6, 4, 10, 9, 6, 9, 4, 7, 6, 14, 12, 2, 6, 5, 10, 7, 10, 8, 4, 4, 10, 14, 8, 6, 6, 10, 8, 10, 12, 15, 8, 6, 14 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 COMMENTS Conjecture: a(n) > 0 for all n > 51. LINKS Ilya Gutkovskiy, Extended graphical example Eric Weisstein's World of Mathematics, Multiplicative Perfect Number FORMULA G.f.: (Sum_{k>=1} x^A007422(k))^2. EXAMPLE a(16) = 5 because we have [15, 1], [10, 6], [8, 8], [6, 10] and [1, 15]. MATHEMATICA nmax = 95; CoefficientList[Series[Sum[Boole[Sqrt[k]^DivisorSigma[0, k]/k == k] x^k, {k, 1, nmax}]^2, {x, 0, nmax}], x] CROSSREFS Cf. A007422, A236473, A280683, A282569. Sequence in context: A243822 A277150 A156596 * A026613 A117199 A230632 Adjacent sequences:  A282567 A282568 A282569 * A282571 A282572 A282573 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Feb 18 2017 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 January 20 16:20 EST 2019. Contains 319335 sequences. (Running on oeis4.)