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.
usigma[n_] := Sum[ Boole[GCD[d, n/d] == 1]*d, {d, Divisors[n]}]; untouchableQ[n_] := (r = True; x = 1; While[x <= n, If[usigma[x] == n, r = False; Break[], x++]]; r); Select[Range[120], untouchableQ] (* Jean-François Alcover, Jan 03 2013 *)
usigma(n) = {my(f = factor(n)); prod(i = 1, #f~, 1 + f[i, 1]^f[i, 2]);}
lista(kmax) = {my(v = vector(kmax), s); for(k = 1, kmax, s = usigma(k); if(s <= kmax, v[s]++)); for(k = 1, kmax, if(v[k] == 0, print1(k, ", ")))}; \\ Amiram Eldar, Jun 09 2024
a(8) = 2 since 8 is the sum of the proper unitary divisors of 10 (1 + 2 + 5) and 12 (1 + 3 + 4).
us[1] = 0; us[n_] := Times @@ (1 + Power @@@ FactorInteger[n]) - n; m = 100; v = Table[0, {m}]; Do[u = us[k]; If[2 <= u <= m, v[[u]]++], {k, 1, m^2}]; Rest @ v
fun[p_, e_] := Module[{b = IntegerDigits[e, 2]}, m = Length[b]; Product[If[b[[j]] > 0, 1 + p^(2^(m - j)), 1], {j, 1, m}]]; isigma[1] = 1; isigma[n_] := isigma[n] = Times @@ (fun @@@ FactorInteger[n]); untouchableQ[n_] := Catch[ Do[ If[n == isigma[k]-k, Throw[True]], {k, 0, (n-1)^2}]] === Null; Reap[ Table[ If[ untouchableQ[n], Sow[n]], {n, 2, 1000}]][[2, 1]] (* after Jean-François Alcover at A005114 *)
fun[p_, e_] := If[OddQ[e], (p^(e+1)-1)/(p-1), (p^(e+1)-1)/(p-1)-p^(e/2)]; bsigma[1] = 1; bsigma[n_] := bsigma[n] = Times @@ (fun @@@ FactorInteger[n]); untouchableQ[n_] := Catch[ Do[ If[n == bsigma[k]-k, Throw[True]], {k, 0, (n-1)^2}]] === Null; Reap[ Table[ If[ untouchableQ[n], Sow[n]], {n, 2, 550}]][[2, 1]] (* after Jean-François Alcover at A005114 *)
us[1] = 0; us[n_] := Times @@ (1 + Power @@@ FactorInteger[n]) - n; m = 300; v = Table[0, {m}]; Do[u = us[k]; If[2 <= u <= m, v[[u]]++], {k, 1, m^2}]; s = {}; vm = -1; Do[If[v[[k]] > vm, vm = v[[k]]; AppendTo[s, k]], {k, 2, m}]; s
us[1] = 0; us[n_] := Times @@ (1 + Power @@@ FactorInteger[n]) - n; m = 1500; v = Table[0, {m}]; Do[u = us[k]; If[2 <= u <= m, v[[u]]++], {k, 1, m^2}]; Position[v, 1] // Flatten
5 is in the sequence since it is a unitary untouchable number and the next unitary untouchable number after it is 7 = 5 + 2 with a record gap of 2. The next gap which is larger than 2 occurs at 7 which is followed by 374 = 7 + 367.
f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - 1; s[1] = 0; s[n_] := Times @@ f @@@ FactorInteger[n] - n; seq[max_] := Module[{v = Table[0, {max}], i}, Do[i = s[k]; If[0 < i <= max, v[[i]]++], {k, 1, max^2}]; Position[v, _?(# == 0 &)] // Flatten]; seq[200]
s(n) = {my(f = factor(n)); prod(i = 1, #f~, (f[i, 1]^(f[i, 2] + 1) - 1)/(f[i, 1] - 1) - 1) - n;}
lista(nmax) = {my(v = vector(nmax), i); for(k = 1, nmax^2, i = s(k); if(i > 0 && i <= nmax, v[i]++)); for(k = 1, nmax, if(v[k] == 0, print1(k, ", ")));}
fun[p_, e_] := DivisorSum[e, p^# &]; esigma[1] = 1; esigma[n_] := esigma[n] = Times @@ fun @@@ FactorInteger[n]; untouchableQ[n_] := Catch[ Do[ If[n == esigma[k]-k, Throw[True]], {k, 0, (n+1)^2}]] === Null; Reap[ Table[ If[ untouchableQ[n], Sow[n]], {n, 1, 130}]][[2, 1]] (* after Jean-François Alcover at A005114 *)
Comments