A007370 -id:A007370 - cp's OEIS frontend

A308098 Numbers m such that sequence of their values of sigma(m) corresponds to sequence of unique values of function sigma(n) for n >= 1 in increasing order (A007370).

1, 2, 3, 5, 4, 7, 9, 13, 8, 19, 12, 29, 22, 37, 18, 27, 43, 49, 61, 32, 67, 73, 45, 36, 50, 101, 109, 91, 81, 64, 121, 137, 149, 157, 133, 106, 163, 98, 173, 129, 169, 193, 72, 197, 199, 134, 211, 100, 146, 229, 241, 128, 217, 257, 171, 148, 277, 281, 283, 219

Offset: 1

Jaroslav Krizek, May 12 2019

nonn

A211656 is the sorted version of this sequence.

			a(6) = 7 because A007370(6) = 8 and there is only one solution of equation sigma(x) = 8 for x = 7.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Index entries for sequences related to sigma(n)

Cf. A000203, A007370, A211656, A211657.

[[m: m in [1..1000] | SumOfDivisors(m) eq n]:  n in [1..100] | #[#[m]: m in [1..1000] | SumOfDivisors(m) eq n] eq 1]

m = 500; v = Table[0, {m}]; Do[s = DivisorSigma[1, k]; If[s <= m ,  v[[s]] = If[ v[[s]] == 0, k, -1]], {k, 1, m - 1}]; Select[v, # > 0 &] (* Amiram Eldar, Jul 04 2019 *)

A000203(a(n)) = A007370(n) for all n.

A007368 Smallest k such that sigma(x) = k has exactly n solutions.

Original entry on oeis.org

2, 1, 12, 24, 96, 72, 168, 240, 336, 360, 504, 576, 1512, 1080, 1008, 720, 2304, 3600, 5376, 2520, 2160, 1440, 10416, 13392, 3360, 4032, 3024, 7056, 6720, 2880, 6480, 10800, 13104, 5040, 6048, 4320, 13440, 5760, 18720, 20736, 19152, 22680, 43680

Offset: 0

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

nonn

It's not obvious that a(n) exists for all n; I'd like to see a proof. - David Wasserman, Jun 07 2002
Note that k-1 is frequently prime. See A115374 for the least prime. For each n, it appears that there are an infinite number of k such that sigma(x)=k has exactly n solutions. - T. D. Noe, Jan 21 2006
According to Sierpiński, H. J. Kanold proved that there is a k such that sigma(x)=k has n or more solutions. Sierpiński states that Erdős proved that if, for some k, sigma(x)=k has exactly n solutions, then there are an infinite number of such k. - T. D. Noe, Oct 18 2006
Index of the first occurrence of n in A054973. - Jaroslav Krizek, Apr 25 2009

			a(10) = 504; {204, 220, 224, 246, 284, 286, 334, 415, 451, 503} is the set of x such that sigma(x) = 504.

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe and Donovan Johnson, Table of n, a(n) for n = 0..5000 (terms up to a(429) from T. D. Noe)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Kevin Ford, Sergei Konyagin, On two conjectures of Sierpiński concerning the arithmetic functions σ and ϕ, arXiv:1910.08452 [math.NT], 2019.
W. Sierpiński, Elementary Theory of Numbers, Warszawa 1964, page 166.
R. G. Wilson, V, Letter to N. J. A. Sloane, Jul. 1992

Cf. A000203, A054973, A002191, A007609.
Cf. A115374 (least prime p such that sigma(x)=sigma(p) has exactly n solutions).
Cf. A007369, A007370, A007371, A007372 (n such that sigma(x)=k has 0, 1, 2 and 3 solutions).
Cf. A184393, A184394, A201915 (smallest solution, largest solution, triangle of solutions for sigma(x)=a(n)).

Needs["Statistics`DataManipulation`"]; s=DivisorSigma[1, Range[10^5]]; f=Frequencies[s]; fs=Sort[f]; tfs=Transpose[fs][[1]]; utfs=Union[tfs]; firstMissing=First[Complement[Range[Last[utfs]], utfs]]; pos=1; Table[While[tfs[[pos]]T. D. Noe *)
terms = 100; cnt = DivisorSigma[1, Range[terms^3]] // Tally // Sort; a[0] = 2; a[n_] := SelectFirst[cnt, #[[2]] == n&][[1]]; Table[a[n], {n, 0, terms - 1}] (* Jean-François Alcover, Jul 18 2017 *)

More terms from David W. Wilson

A211656 Numbers k such that the value of sigma(k) is unique; sigma(k) = A000203(k) = sum of divisors of k.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 12, 13, 18, 19, 22, 27, 29, 32, 36, 37, 43, 45, 49, 50, 61, 64, 67, 72, 73, 81, 91, 98, 100, 101, 106, 109, 121, 128, 129, 133, 134, 137, 146, 148, 149, 152, 157, 162, 163, 169, 171, 173, 192, 193, 197, 199, 200, 202, 211, 217, 218, 219

Offset: 1

Jaroslav Krizek, Apr 20 2012

nonn

Values of sigma(n) in increasing order are in A007370. Corresponding values of sigma(a(n)) is in A211657(n).
Complement of A206036 (numbers n such that sigma(n) = sigma(k) has solution for distinct numbers n and k).
Union of A066076 (primes p such that value of sigma(p) is unique) and A211658 (nonprimes p such that value of sigma(p) is unique).

			Number 36 is in sequence because sigma(36) = 91 and there is no other number m with sigma(m) = 91.
Number 6 is not in the sequence because sigma(6) = 12 and 12 is also sigma(11).

Robert Israel, Table of n, a(n) for n = 1..10000
Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).

Cf. A000203, A007370, A066076, A211657, A211658, A211659, A211660, A206036.

N:= 1000: # to get terms < the least m with sigma(m) > N
S:= map(numtheory:-sigma, [$1..N-1]):
m:=min(select(t -> S[t]>N, [$1..N-1]))-1:
select(n->numboccur(S[n],S)=1, [$1..m]); # Robert Israel, Jul 04 2019

nn = 300; mx = Max[DivisorSigma[1, Range[nn]]]; d = DivisorSigma[1, Range[mx]]; t = Transpose[Select[Sort[Tally[d]], #[[1]] <= mx && #[[2]] == 1 &]][[1]]; Select[Range[nn], MemberQ[t, d[[#]]] &] (* T. D. Noe, Apr 20 2012 *)

isok(k) = invsigmaNum(sigma(k)) == 1; \\ Amiram Eldar, Jan 11 2025, using Max Alekseyev's invphi.gp

A007371 Numbers k such that sigma(x) = k has exactly 2 solutions.

Original entry on oeis.org

12, 18, 31, 32, 54, 56, 80, 98, 104, 108, 114, 124, 126, 128, 132, 140, 152, 156, 182, 186, 210, 264, 272, 280, 308, 320, 342, 378, 390, 392, 399, 403, 408, 416, 440, 444, 448, 492, 522, 532, 570, 572, 594, 608, 630, 632, 726, 762, 770, 774, 780, 784, 800

Offset: 1

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

nonn

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Donovan Johnson)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).
Robert G. Wilson v, Letter to N. J. A. Sloane, Jul. 1992.

Cf. A000203.

Number of solutions: A007369 (0), A007370 (1), this sequence (2), A007372 (3), A060660 (4), A060661 (5), A060662 (6), A060663 (7), A060664 (8), A060665 (9), A060666 (10), A060678 (11), A060676 (12).

a = Table[ 0, {750} ]; Do[ s = DivisorSigma[ 1, n ]; If[ s < 751, a[ [ s ] ]++ ], {n, 1, 750} ]; Select[ Range[ 750 ], a[ [ # ] ] == 2 & ]

is(n)=sum(k=1,n,sigma(k)==n)==2 \\ Charles R Greathouse IV, Mar 09 2014

is(k) = invsigmaNum(k) == 2 \\ Amiram Eldar, Nov 17 2024, using Max Alekseyev's invphi.gp

A007372 Numbers k such that sigma(x) = k has exactly 3 solutions.

Original entry on oeis.org

24, 42, 48, 60, 84, 90, 224, 228, 234, 248, 270, 294, 324, 450, 468, 528, 558, 620, 640, 660, 810, 882, 888, 896, 968, 972, 1020, 1050, 1104, 1116, 1140, 1216, 1232, 1240, 1274, 1332, 1392, 1400, 1452, 1456, 1464, 1482, 1524, 1530, 1600, 1694, 1716, 1760

Offset: 1

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

nonn

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Donovan Johnson)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).
Robert G. Wilson v, Letter to N. J. A. Sloane, Jul. 1992.

Cf. A000203.

Number of solutions: A007369 (0), A007370 (1), A007371 (2), this sequence (3), A060660 (4), A060661 (5), A060662 (6), A060663 (7), A060664 (8), A060665 (9), A060666 (10), A060678 (11), A060676 (12).

a = Table[ 0, {2500} ]; Do[ s = DivisorSigma[ 1, n ]; If[ s < 2501, a[ [ s ] ]++ ], {n, 1, 2500} ]; Select[ Range[ 2500 ], a[ [ # ] ] == 3 & ]

is(n)=sum(k=1,n,sigma(k)==n)==3 \\ Charles R Greathouse IV, Mar 09 2014

is(k) = invsigmaNum(k) == 3 \\ Amiram Eldar, Nov 17 2024, using Max Alekseyev's invphi.gp

A060660 Numbers k such that sigma(x) = k has exactly 4 solutions.

Original entry on oeis.org

96, 120, 180, 312, 372, 420, 434, 456, 540, 546, 560, 624, 702, 728, 798, 816, 930, 1064, 1120, 1170, 1404, 1632, 1638, 1674, 1710, 1776, 1792, 1944, 2100, 2240, 2544, 2560, 2664, 2760, 2800, 2844, 2856, 2940, 2952, 3000, 3040, 3048, 3060, 3080, 3096

Offset: 1

Robert G. Wilson v, Apr 18 2001

nonn

			96 = sigma(42) = sigma(62) = sigma(69) = sigma(77).

Amiram Eldar, Table of n, a(n) for n = 1..10000
Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).

Cf. A000203.

Number of solutions: A007369 (0), A007370 (1), A007371 (2), A007372 (3), this sequence (4), A060661 (5), A060662 (6), A060663 (7), A060664 (8), A060665 (9), A060666 (10), A060678 (11), A060676 (12).

a = Table[ 0, {5000} ]; Do[ s = DivisorSigma[ 1, n ]; If[ s < 5001, a[ [ s ] ]++ ], {n, 1, 5000} ]; Select[ Range[ 5000 ], a[ [ # ] ] == 4 & ]

is(k) = invsigmaNum(k) == 4 \\ Amiram Eldar, Nov 17 2024, using Max Alekseyev's invphi.gp

A060661 Numbers k such that sigma(x) = k has exactly 5 solutions.

Original entry on oeis.org

72, 144, 192, 216, 588, 600, 648, 792, 936, 992, 1056, 1224, 1302, 1320, 1560, 1736, 1980, 2040, 2088, 2112, 2268, 2448, 2730, 2790, 2912, 3038, 3136, 3312, 3472, 3520, 3534, 3552, 3672, 3792, 3816, 3936, 4056, 4092, 4340, 4440, 4864, 4872, 4920, 4960

Offset: 1

Robert G. Wilson v, Apr 18 2001

nonn

			72 = sigma(30) = sigma(46) = sigma(51) = sigma(55) = sigma(71).

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Harvey P. Dale)
Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).

Cf. A000203.

Number of solutions: A007369 (0), A007370 (1), A007371 (2), A007372 (3), A060660 (4), this sequence (5), A060662 (6), A060663 (7), A060664 (8), A060665 (9), A060666 (10), A060678 (11), A060676 (12).

a = Table[ 0, {5000} ]; Do[ s = DivisorSigma[ 1, n ]; If[ s < 5001, a[ [ s ] ]++ ], {n, 1, 5000} ]; Select[ Range[ 5000 ], a[ [ # ] ] == 5 & ]
With[{upto=5000},Select[Union[Transpose[Select[Tally[DivisorSigma[ 1, Range[ upto]]],#[[2]]==5&]][[1]]],#<=upto&]] (* Harvey P. Dale, Jan 27 2015 *)

is(k) = invsigmaNum(k) == 5 \\ Amiram Eldar, Nov 17 2024, using Max Alekseyev's invphi.gp

A060662 Numbers k such that sigma(x) = k has exactly 6 solutions.

Original entry on oeis.org

168, 252, 288, 384, 768, 1248, 1584, 1860, 2052, 2480, 2904, 3906, 3968, 4116, 4176, 4224, 4256, 4284, 4392, 4416, 4620, 5824, 5850, 5856, 5928, 6084, 6192, 6216, 6600, 6636, 6660, 6888, 6944, 7104, 7182, 7308, 7840, 7992, 8184, 8976, 9114, 9480, 9856

Offset: 1

Robert G. Wilson v, Apr 18 2001

nonn

			168 = sigma(60) = sigma(78) = sigma(92) = sigma(123) = sigma(143) = sigma(167).

Robert Israel, Table of n, a(n) for n = 1..10000
Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).

Cf. A000203.

Number of solutions: A007369 (0), A007370 (1), A007371 (2), A007372 (3), A060660 (4), A060661 (5), this sequence (6), A060663 (7), A060664 (8), A060665 (9), A060666 (10), A060678 (11), A060676 (12).

N:= 10^4: # for terms <= N
V:= Vector(N):
for n from 1 to N-1 do
 s:= numtheory:-sigma(n);
 if s <= N then V[s]:= V[s]+1 fi
od:
select(t -> V[t]=6, [$1..N]); # Robert Israel, Nov 21 2019

a = Table[ 0, {10000} ]; Do[ s = DivisorSigma[ 1, n ]; If[ s < 10001, a[ [ s ] ]++ ], {n, 1, 10000} ]; Select[ Range[ 10000 ], a[ [ # ] ] == 6 & ]

is(k) = invsigmaNum(k) == 6 \\ Amiram Eldar, Nov 18 2024, using Max Alekseyev's invphi.gp

A060663 Numbers k such that sigma(x) = k has exactly 7 solutions.

Original entry on oeis.org

240, 684, 744, 912, 1092, 1176, 1200, 1368, 1596, 2340, 2376, 2496, 2700, 3072, 3348, 4212, 5460, 5520, 5586, 5642, 5712, 6000, 6160, 6264, 6804, 6864, 7068, 7254, 7584, 7632, 7728, 8112, 8232, 8370, 8512, 8680, 8712, 8832, 8960, 9744, 9936

Offset: 1

Robert G. Wilson v, Apr 18 2001

nonn

			240 = sigma(114) = sigma(135) = sigma(158) = sigma(177) = sigma(203) = sigma(209) = sigma(239).

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Harvey P. Dale)
Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).

Cf. A000203.

Number of solutions: A007369 (0), A007370 (1), A007371 (2), A007372 (3), A060660 (4), A060661 (5), A060662 (6), this sequence (7), A060664 (8), A060665 (9), A060666 (10), A060678 (11), A060676 (12).

a = Table[ 0, {10000} ]; Do[ s = DivisorSigma[ 1, n ]; If[ s < 10001, a[ [ s ] ]++ ], {n, 1, 10000} ]; Select[ Range[ 10000 ], a[ [ # ] ] == 7 & ]
With[{upto=10000},Select[Tally[DivisorSigma[1,Range[upto]]],#[[2]]==7 && #[[1]] <= upto&]][[All,1]]//Sort (* Harvey P. Dale, Jun 22 2019 *)

is(k) = invsigmaNum(k) == 7 \\ Amiram Eldar, Nov 18 2024, using Max Alekseyev's invphi.gp

A060664 Numbers k such that sigma(x) = k has exactly 8 solutions.

Original entry on oeis.org

336, 432, 672, 756, 840, 1536, 1620, 1764, 1848, 2280, 2394, 2604, 2808, 3264, 4080, 4480, 4860, 5328, 6528, 6624, 7128, 8316, 8568, 8880, 10608, 11040, 11448, 12288, 12420, 12636, 13176, 13200, 13248, 13536, 13860, 14196, 14208, 14448, 14700

Offset: 1

Robert G. Wilson v, Apr 18 2001

nonn

			336 = sigma(132) = sigma(140) = sigma(182) = sigma(188) = sigma(195) = sigma(249) = sigma(287) = sigma(299).

Robert Israel, Table of n, a(n) for n = 1..10000
Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).

Cf. A000203.

Number of solutions: A007369 (0), A007370 (1), A007371 (2), A007372 (3), A060660 (4), A060661 (5), A060662 (6), A060663 (7), this sequence (8), A060665 (9), A060666 (10), A060678 (11), A060676 (12).

N:= 30000: # to get terms <= N
V:= Vector(N):
for k from 1 to N-1 do
  t:= numtheory:-sigma(k);
  if t <= N then V[t]:= V[t]+1 fi
od:
select(t -> V[t]=8, [$1..N]); # Robert Israel, Sep 22 2019

a = Table[ 0, {20000} ]; Do[ s = DivisorSigma[ 1, n ]; If[ s < 20001, a[ [ s ] ]++ ], {n, 1, 20000} ]; Select[ Range[ 20000 ], a[ [ # ] ] == 8 & ]

is(k) = invsigmaNum(k) == 8 \\ Amiram Eldar, Nov 18 2024, using Max Alekseyev's invphi.gp

cp's OEIS Frontend

A308098 Numbers m such that sequence of their values of sigma(m) corresponds to sequence of unique values of function sigma(n) for n >= 1 in increasing order (A007370).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A007368 Smallest k such that sigma(x) = k has exactly n solutions.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Extensions

A211656 Numbers k such that the value of sigma(k) is unique; sigma(k) = A000203(k) = sum of divisors of k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A007371 Numbers k such that sigma(x) = k has exactly 2 solutions.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

A007372 Numbers k such that sigma(x) = k has exactly 3 solutions.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

A060660 Numbers k such that sigma(x) = k has exactly 4 solutions.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A060661 Numbers k such that sigma(x) = k has exactly 5 solutions.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A060662 Numbers k such that sigma(x) = k has exactly 6 solutions.