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-8 of 8 results.

A007691 Multiply-perfect numbers: n divides sigma(n).

Original entry on oeis.org

1, 6, 28, 120, 496, 672, 8128, 30240, 32760, 523776, 2178540, 23569920, 33550336, 45532800, 142990848, 459818240, 1379454720, 1476304896, 8589869056, 14182439040, 31998395520, 43861478400, 51001180160, 66433720320, 137438691328, 153003540480, 403031236608
Offset: 1

Views

Author

N. J. A. Sloane, Robert G. Wilson v

Keywords

Comments

sigma(n)/n is in A054030.
Also numbers such that the sum of the reciprocals of the divisors is an integer. - Harvey P. Dale, Jul 24 2001
Luca's solution of problem 11090, which proves that for k>1 there are an infinite number of n such that n divides sigma_k(n), does not apply to this sequence. However, it is conjectured that this sequence is also infinite. - T. D. Noe, Nov 04 2007
Numbers k such that sigma(k) is divisible by all divisors of k, subsequence of A166070. - Jaroslav Krizek, Oct 06 2009
A017666(a(n)) = 1. - Reinhard Zumkeller, Apr 06 2012
Bach, Miller, & Shallit show that this sequence can be recognized in polynomial time with arbitrarily small error by a probabilistic Turing machine; that is, this sequence is in BPP. - Charles R Greathouse IV, Jun 21 2013
Conjecture: If n is such that 2^n-1 is in A066175 then a(n) is a triangular number. - Ivan N. Ianakiev, Aug 26 2013
Conjecture: Every multiply-perfect number is practical (A005153). I've verified this conjecture for the first 5261 terms with abundancy > 2 using Achim Flammenkamp's data. The even perfect numbers are easily shown to be practical, but every practical number > 1 is even, so a weak form says every even multiply-perfect number is practical. - Jaycob Coleman, Oct 15 2013
Numbers such that A054024(n) = 0. - Michel Marcus, Nov 16 2013
Numbers n such that k(n) = A229110(n) = antisigma(n) mod n = A024816(n) mod n = A000217(n) mod n = (n(n+1)/2) mod n = A142150(n). k(n) = n/2 for even n; k(n) = 0 for odd n (for number 1 and eventually odd multiply-perfect numbers n > 1). - Jaroslav Krizek, May 28 2014
The only terms m > 1 of this sequence that are not in A145551 are m for which sigma(m)/m is not a divisor of m. Conjecture: after 1, A323653 lists all such m (and no other numbers). - Antti Karttunen, Mar 19 2021

Examples

			120 is OK because divisors of 120 are {1,2,3,4,5,6,8,10,12,15,20,24,30,40,60,120}, the sum of which is 360=120*3.

References

  • A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 22.
  • J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 176.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • I. Stewart, L'univers des nombres, "Les nombres multiparfaits", Chapter 15, pp. 82-88, Belin-Pour La Science, Paris 2000.
  • James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 141-148.
  • David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Penguin Books, 1987, pp. 135-136.

Links

Crossrefs

Complement is A054027. Cf. A000203, A054030.
Cf. A000396, A005820, A027687, A046060, A046061, for subsequences of terms with quotient sigma(n)/n = 2..6.
Other subsequences: A046985, A046986, A046987, A047728, A065997, A066289, (A076231, A076233, A076234), A088844, A088845, A088846, A091443, A114887, A166069, A245782, A260508, A306667, (A325021 U A325022), (A325023 U A325024), (A325025 U A325026), A325637, A323653, A330532, (A330533 U A331724), A336702, A341045.
Subsequence of the following sequences: A011775, A071707, A083865, A089748 (after the initial 1), A102783, A166070, A175200, A225110, A226476, A237719, A245774, A246454, A259307, A263928, A282775, A323652, A336745, A340864. Also conjectured to be a subsequence of A005153, of A307740, and after 1 also of A295078.
Various number-theoretical functions applied to these numbers: A088843 [tau], A098203 [phi], A098204 [gcd(a(n),phi(a(n)))], A134665 [2-adic valuation], A307741 [sigma], A308423 [product of divisors], A320024 [the odd part], A134740 [omega], A342658 [bigomega], A342659 [smallest prime not dividing], A342660 [largest prime divisor].
Positions of ones in A017666, A019294, A094701, A227470, of zeros in A054024, A082901, A173438, A272008, A318996, A326194, A341524. Fixed points of A009194.
Cf. A069926, A330746 (left inverses, when applied to a(n) give n).
Cf. A007358, A189000, A327158, A332318/A332319 (for analogs) and A046762, A046763, A046764, A055715, A056006, A081756, A214842, A227302, A227306, A245775, A300906, A325639 (other variants).
Cf. (other related sequences) A007539, A066135, A066961, A093034, A094467, A134639, A145551, A019278, A194771 [= 2*a(n)], A219545, A229110, A262432, A335830, A336849, A341608.

Programs

  • Haskell
    a007691 n = a007691_list !! (n-1)
a007691_list = filter ((== 1) . a017666) [1..]
-- Reinhard Zumkeller, Apr 06 2012
  • Mathematica
    Do[If[Mod[DivisorSigma[1, n], n] == 0, Print[n]], {n, 2, 2*10^11}] (* or *)
Transpose[Select[Table[{n, DivisorSigma[-1, n]}, {n, 100000}], IntegerQ[ #[[2]] ]& ] ][[1]]
(* Third program: *)
Select[Range[10^6], IntegerQ@ DivisorSigma[-1, #] &] (* Michael De Vlieger, Mar 19 2021 *)
  • PARI
    for(n=1,1e6,if(sigma(n)%n==0, print1(n", ")))
  • Python
    from sympy import divisor_sigma as sigma
def ok(n): return sigma(n, 1)%n == 0
print([n for n in range(1, 10**4) if ok(n)]) # Michael S. Branicky, Jan 06 2021

Extensions

More terms from Jud McCranie and then from David W. Wilson.
Incorrect comment removed and the crossrefs-section reorganized by Antti Karttunen, Mar 20 2021

A323653 Multiperfect numbers m such that sigma(m) is also multiperfect.

Original entry on oeis.org

1, 459818240, 51001180160, 13188979363639752997731839211623940096, 5157152737616023231698245840143799191339008, 54530444405217553992377326508106948362108928, 133821156044600922812153118065015159487725568, 4989680372093758991515359988337845750507257510078971904
Offset: 1

Views

Author

Jaroslav Krizek, Jan 21 2019

Keywords

Comments

Multiperfect numbers m such that sigma(m) divides sigma(sigma(m)).
Also k-multiperfect numbers m such that k*m is also multiperfect.
Corresponding values of numbers k(n) = sigma(a(n)) / a(n): 1, 3, 3, 5, 5, 5, 5, 5, ...
Corresponding values of numbers h(n) = sigma(k(n) * a(n)) / (k(n) * a(n)): 1, 4, 4, 6, 6, 6, 6, 6, ...
Number of k-multiperfect numbers m such that sigma(n) is also multiperfect for k = 3..6: 2, 0, 20, 0.
From Antti Karttunen, Mar 20 2021, Feb 18 2022: (Start)
Conjecture 1 (a): This sequence consists of those m for which sigma(m)/m is an integer (thus a term of A007691), and coprime with m. Or expressed in a slightly weaker form (b): {1} followed by those m for which sigma(m)/m is an integer, but not a divisor of m. In a slightly stronger form (c): For m > 1, sigma(m)/m is always the least prime not dividing m. This would imply both (a) and (b) forms.
Conjecture 2: This sequence is finite.
Conjecture 3: This sequence is the intersection of A007691 and A351458.
Conjecture 4: This is a subsequence of A349745, thus also of A351551 and of A351554.
Note that if there existed an odd perfect number x that were not a multiple of 3, then both x and 2*x would be terms in this sequence, as then we would have: sigma(x)/x = 2, sigma(2*x)/(2*x) = 3, sigma(6*x)/(6*x) = 4. See also the diagram in A347392 and A353365.
(End)
From Antti Karttunen, May 16 2022: (Start)
Apparently for all n > 1, A336546(a(n)) = 0. [At least for n=2..23], while A353633(a(n)) = 1, for n=1..23.
The terms a(1) .. a(23) are only cases present among the 5721 known and claimed multiperfect numbers with abundancy <> 2, as published 03 January 2022 under Flammenkamp's site, that satisfy the condition for inclusion in this sequence.
They are also the only 23 cases among that data such that gcd(n, sigma(n)/n) = 1, or in other words, for which the n and its abundancy are relatively prime, with abundancy in all cases being the least prime that does not divide n, A053669(n), which is a sufficient condition for inclusion in A351458.
(End)

Examples

			3-multiperfect number 459818240 is a term because number 3*459818240 = 1379454720 is a 4-multiperfect number.

Links

Crossrefs

Cf. A000396, A005820, A027687, A046060, A046061, A053669, A054030, A145551, A323652, A336546, A342659, A347392, A349745, A351458, A351551, A351554, A353365.
Intersection of any two of these three sequences: A007691, A019278, A066961.

Programs

  • Magma
    [n: n in [1..10^6] | SumOfDivisors(n) mod n eq 0 and SumOfDivisors(SumOfDivisors(n)) mod SumOfDivisors(n) eq 0];
  • PARI
    ismulti(n) = (sigma(n) % n) == 0;
isok(n) = ismulti(n) && ismulti(sigma(n)); \\ Michel Marcus, Jan 26 2019

A326181 Numbers n for which sigma(sigma(n)) = 3*sigma(n).

Original entry on oeis.org

54, 56, 87, 95, 276, 308, 429, 446, 455, 501, 581, 611, 158928, 194928, 195072, 199950, 226352, 234608, 236432, 248325, 255678, 263504, 266192, 273050, 275415, 304575, 336903, 341162, 353675, 366575, 369425, 369843, 380463, 386313, 389463, 406565, 411725, 415925, 422303, 447587, 468743, 497333, 500993, 511829, 515267, 519557, 519677
Offset: 1

Views

Author

Antti Karttunen, Jun 16 2019

Keywords

Comments

Any odd perfect numbers must occur in this sequence, as such numbers must be in the intersection of A000396 and A326051, that is, satisfy both sigma(n) = 2n and sigma(2n) = 6n = 3*2n, thus in combination they must satisfy sigma(sigma(n)) = 3*sigma(n). Note that odd perfect numbers should occur also in A019283.
If, as conjectured, A005820 has 6 terms, then this sequence is finite and has 756 terms. - Giovanni Resta, Jun 17 2019

Links

Crossrefs

Cf. A000203, A000396, A005820, A019283, A051027, A087943, A272027 (3*sigma(n)), A326051.
Subsequence of A066961.

Programs

  • PARI
    isA326181(n) = { my(s=sigma(n)); (sigma(s)==3*s); };

A353365 Numbers k such that the odd part of sigma(sigma(k)) is equal to the odd part of sigma(k).

Original entry on oeis.org

1, 5, 12, 427, 9120, 9180, 9504, 9720, 9960, 10296, 10620, 10740, 10824, 11070, 11310, 11480, 11484, 11556, 11628, 11748, 11934, 11960, 12024, 12036, 12072, 12084, 12376, 12460, 12510, 12570, 12640, 12924, 12980, 13000, 13216, 13340, 13554, 13804, 13806, 13962, 13984, 14022, 14056, 14094, 14178, 14212, 14336, 14380
Offset: 1

Views

Author

Antti Karttunen, Apr 17 2022

Keywords

Comments

Numbers k such that sigma(sigma(k)) = 2^e * sigma(k), for some e >= 0.
Numbers k such that sigma(k) is in A336702.
Numbers k for which A000265(A051027(k)) = A161942(k).
If there existed any hypothetical 3-perfect number (A005820) of the form x = 4u+2 and not divisible by 3, then x would be also included in this sequence, as then sigma(sigma(x)) = 12*x = 4*sigma(x). Such x would be also a term of A349745 and of A351458, and x/2 would be a rare odd term of A000396, and also in A336702. See also the diagram in A347392.

Links

Crossrefs

Cf. A000203, A000265, A000396, A005820, A051027, A161942, A336702.
Subsequence of A066961.
Cf. also A336700, A336701, A347383, A347392, A349745, A351458 and also A353363.

Programs

A146542 Numbers m such that sigma(m) is a perfect number.

Original entry on oeis.org

5, 12, 427, 10924032, 16125952, 22017387, 24376323, 32501857, 33288097, 3757637632, 6241076643, 8522760577, 45091651584, 66563866624, 86692869921, 137421905953, 137437511683, 727145809044307968, 1152771972099211264, 845044701535107443245558061611352064
Offset: 1

Views

Author

Howard Berman (howard_berman(AT)hotmail.com), Oct 31 2008

Keywords

Examples

			The divisors of 5 are 1 and 5, which add up to 6. 6 is a perfect number because its proper divisors are 1, 2 and 3, which also add up to 6.

Links

Crossrefs

Cf. A000396, A066961, A081357.

Programs

  • Maple
    with(numtheory); P:=proc(q) local n; for n from 1  to q do
if sigma(sigma(n))=2*sigma(n) then print(n);
fi; od; end: P(10^9); # Paolo P. Lava, Oct 22 2013
  • PARI
    isok(n) = sigma(sigma(n)) == 2*sigma(n); \\ Michel Marcus, Oct 22 2013

Extensions

Two missing terms added and a(10)-a(19) from Donovan Johnson, Jan 20 2012
a(20) from Daniel Suteu, May 23 2022

A354073 Multiply-perfect numbers that are the sum of the divisors of some number.

Original entry on oeis.org

1, 6, 28, 120, 496, 672, 30240, 32760, 523776, 2178540, 23569920, 33550336, 45532800, 142990848, 459818240, 1379454720, 1476304896, 8589869056, 14182439040, 31998395520, 43861478400, 51001180160, 66433720320, 137438691328, 153003540480, 403031236608, 518666803200
Offset: 1

Views

Author

Jaroslav Krizek, May 16 2022

Keywords

Comments

Conjecture: 8128 is only multiply-perfect number that is not in this sequence.
The distinct values of A000203(A066961(n)).

Examples

			The multiply-perfect number 28 is in the sequence because 28 = sigma(12).

Links

Crossrefs

Intersection of A007691 and A002191.
Cf. A000203, A066961, A354072, A354074.

Programs

  • Magma
    Set(Sort([&+Divisors(m): m in [1..10^7] | IsIntegral(&+Divisors(&+Divisors(m)) / &+Divisors(m))]))

Extensions

a(18)-a(27) from Amiram Eldar, May 12 2024

A289124 Numbers n such that sigma(sigma(n))/sigma(n) > sigma(sigma(m))/sigma(m) for all m < n.

Original entry on oeis.org

1, 2, 3, 5, 6, 14, 22, 24, 54, 88, 114, 120, 264, 312, 520, 540, 864, 1560, 3432, 4320, 8856, 9120, 10464, 20664, 21276, 32760, 36840, 52320, 92280, 106380, 170040, 185760, 201240, 417960, 613080, 1059480, 1098720, 1937880, 2213640, 2982240, 5611320, 9809280
Offset: 1

Views

Author

Amiram Eldar, Jun 25 2017

Keywords

Comments

Erdős proved that sigma(sigma(n))/sigma(n) is unbounded, thus this sequence is infinite.

Links

Crossrefs

Cf. A000203, A051027, A066961.

Programs

  • Mathematica
    a = {}; k=1; rmax = 0; While[Length[a]<40,s = DivisorSigma[1, k]; s2 = DivisorSigma[1, s]; r = s2/s; If[r > rmax, AppendTo[a, k]; rmax = r]; k++]; a
  • PARI
    r=0; forfactored(n=1,10^10, t=sigma(sigma(n),-1); if(t>r, r=t; print1(n[1]", "))) \\ Charles R Greathouse IV, Jun 25 2017

A353363 Numbers k such that A046523(A332223(A332223(k))) is equal to A046523(A332223(k)).

Original entry on oeis.org

1, 2, 6, 25, 38, 155, 235, 294, 322, 365, 390, 465, 528, 638, 646, 744, 765, 768, 867, 884, 924, 946, 1152, 1172, 1290, 1421, 1600, 1653, 1675, 1677, 1729, 1785, 1980, 1989, 2002, 2028
Offset: 1

Views

Author

Antti Karttunen, Apr 17 2022

Keywords

Comments

Numbers k such that A332223(k) is in A353308.
If there existed any 3-perfect number (A005820) of the form x = 4u+2 and not divisible by 3, then x would be also included in A353365 and A005940(1+x) would be included in this sequence. See comments in A353365.

Links

Crossrefs

Cf. A000203, A005940, A046523, A066961, A156552, A332223, A353365.
Cf. also A353308.
Showing 1-8 of 8 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.