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.
%I A325449 #17 Sep 10 2019 05:01:53
%S A325449 30,38,58,60,66,94,98,102,118,120,132,138,146,158,174,178,188,190,204,
%T A325449 206,222,238,240,246,262,264,276,278,282,290,292,298,306,318,322,326,
%U A325449 338,348,354,374,380,390,398,402,406,408,426,430,444,458,462,474,476,478
%N A325449 Psi-untouchable numbers: impossible values for A306927(n) = A001615(n) - n.
%C A325449 Analogous to untouchable numbers (A005114) with Dedekind psi function (A001615) instead of the sum of divisors function, sigma (A000203).
%C A325449 te Riele named these numbers psi_1-untouchable. He calculated the first 2896 terms (terms below 20000). He proved that this sequence is infinite by showing that all the numbers of the form 2^k*3*5 (k >= 1, A110286(k) except for k = 0) are psi-untouchables.
%H A325449 Amiram Eldar, <a href="/A325449/b325449.txt">Table of n, a(n) for n = 1..10000</a>
%H A325449 H. J. J. te Riele, <a href="http://oai.cwi.nl/oai/asset/13093/13093A.pdf">A theoretical and computational study of generalized aliquot sequences</a> (Doctoral thesis), MCT-74, Mathematisch Centrum, Amsterdam, 1976, Chapter 9.
%t A325449 f[1] = 0; f[n_] := n*(Times @@ (1 + 1/FactorInteger[n][[;; , 1]]) - 1); m = 300; v = Table[0, {m}]; Do[j = f[k]; If[2 <= j <= m, v[[j]]++], {k, 1, m^2}]; Rest[Position[v, _?(# == 0 &)] // Flatten]
%Y A325449 Cf. A001615, A005114, A110286, A306927.
%K A325449 nonn
%O A325449 1,1
%A A325449 _Amiram Eldar_, Sep 06 2019