A211656 Numbers k such that the value of sigma(k) is unique; sigma(k) = A000203(k) = sum of divisors of k.
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
Keywords
Examples
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).
Links
- Robert Israel, Table of n, a(n) for n = 1..10000
- Max Alekseyev, PARI/GP Scripts for Miscellaneous Math Problems (invphi.gp).
Programs
-
Maple
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
-
Mathematica
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 *)
-
PARI
isok(k) = invsigmaNum(sigma(k)) == 1; \\ Amiram Eldar, Jan 11 2025, using Max Alekseyev's invphi.gp
Comments