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.

Previous Showing 11-12 of 12 results.

A348521 Numbers k such that A348271(k) > 2*k.

Original entry on oeis.org

3600, 5040, 6480, 7056, 7920, 9072, 9360, 11088, 11520, 12240, 13680, 14400, 16128, 16560, 18000, 20880, 22320, 25200, 32400, 35280, 39600, 44100, 45360, 46800, 55440, 56700, 57600, 58320, 58800, 61200, 63504, 65520, 68400, 69300, 71280, 75600, 77616, 79380, 80640
Offset: 1

Views

Author

Amiram Eldar, Oct 21 2021

Keywords

Comments

Odd terms exist (e.g., 349476304574870948475). What is the smallest odd term?

Examples

			3600 is a term since the sum of the noninfinitary divisors of 3600 is A348271(3600) = 8073 > 2*3600 = 7200.
		

Crossrefs

Similar sequence: A063846.

Programs

  • Mathematica
    f[p_, e_] := Module[{b = IntegerDigits[e, 2], m}, m = Length[b]; Product[If[b[[j]] > 0, 1 + p^(2^(m - j)), 1], {j, 1, m}]]; isigma[1] = 1; isigma[n_] := Times @@ f @@@ FactorInteger[n]; s[n_] := DivisorSigma[1,n] - isigma[n]; Select[Range[10^5], s[#] > 2*# &]

A348527 Noninfinitary Zumkeller numbers: numbers whose set of noninfinitary divisors is nonempty and can be partitioned into two disjoint sets of equal sum.

Original entry on oeis.org

48, 80, 96, 112, 150, 180, 240, 252, 294, 336, 360, 396, 432, 468, 480, 486, 504, 528, 560, 600, 612, 624, 630, 672, 684, 720, 726, 768, 792, 810, 816, 828, 864, 880, 912, 936, 960, 1008, 1014, 1040, 1044, 1050, 1056, 1104, 1116, 1120, 1134, 1176, 1200, 1232, 1248
Offset: 1

Views

Author

Amiram Eldar, Oct 21 2021

Keywords

Comments

The smallest odd term is a(104) = 2475.

Examples

			48 is a term since its set of noninfinitary divisors, {2, 4, 6, 8, 12, 24}, can be partitioned into the two disjoint sets, {2, 6, 8, 12} and {4, 24}, whose sums are equal: 2 + 6 + 8 + 12 = 4 + 24 = 28.
		

Crossrefs

Programs

  • Mathematica
    nidiv[1] = {}; nidiv[n_] := Complement[Divisors[n], Sort@ Flatten@ Outer[Times, Sequence @@ (FactorInteger[n] /. {p_, m_Integer} :> p^Select[Range[0, m], BitOr[m, #] == m &])]]; nizQ[n_] := Module[{d = nidiv[n], sum, x}, sum = Plus @@ d; sum > 0 && EvenQ[sum] && CoefficientList[Product[1 + x^i, {i, d}], x][[1 + sum/2]] > 0]; Select[Range[1250], !IntegerQ@ Log2@ DivisorSigma[0, #] && nizQ[#] &]
Previous Showing 11-12 of 12 results.