cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A327947 Nonunitary pseudoperfect numbers (A327945) that equal to the sum of a subset of their nonunitary divisors in more ways than any smaller nonunitary pseudoperfect number.

Original entry on oeis.org

24, 48, 72, 96, 144, 216, 240, 288, 360, 480, 720, 1080, 1440, 2160, 2880, 3600, 4320, 5040, 7200, 7560, 10080, 15120, 20160, 25200, 30240
Offset: 1

Views

Author

Amiram Eldar, Sep 30 2019

Keywords

Comments

The nonunitary version of A065218.
The corresponding numbers of ways are 1, 2, 4, 5, 15, 28, 34, 63, 211, 279, 6025, 17436, 187794, 2035726, 5965563, 36449982, 250420995, 3426156924, 8991176276, 37016127059, 6770551810345, 1095548357870254, 13524344273940115, 604532928571438678, 33370817837127087825, ...

Examples

			24 is the least number which is the sum of its nonunitary divisor, thus a(1) = 24.
48 is the least number which is the sum of a subset of its nonunitary divisor in two ways: 24 + 12 + 8 + 4 and 24 + 12 + 8 + 4 + 2, thus a(2) = 48.
		

Crossrefs

Programs

  • Mathematica
    nudiv[n_] := Module[{d = Divisors[n]}, Select[d, GCD[#, n/#] > 1 &]]; s = {}; cm = 0; Do[d = nudiv[n]; If[Total[d] < n, Continue[]]; c = SeriesCoefficient[ Series[Product[1 + x^d[[i]], {i, Length[d]}], {x, 0, n}], n]; If[c > cm, cm = c; AppendTo[s, n]], {n, 1, 1000}]; s
Showing 1-1 of 1 results.