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 A290484 #29 Feb 01 2024 00:26:32 %S A290484 3,11,59,197,389,467,479,503,563,719,839,887,1523,1907,2087,2339,2837, %T A290484 3167,3989,4229,4259,4643,4679,4787,4903,4919,5417,5849,5879,6299, %U A290484 7307,7331,7577,7583,8117 %N A290484 Odd prime numbers that are factors of only one 3-Carmichael number. %C A290484 Beeger proved in 1950 that if p < q < r are primes such that p*q*r is a 3-Carmichael number, then q < 2p^2 and r < p^3. Therefore there is a finite number of 3-Carmichael numbers which divisible by a given prime. %C A290484 An odd prime p is a term if and only if A290481(A033270(p)) = 1. - _Max Alekseyev_, Jan 31 2024 %D A290484 N. G. W. H. Beeger, "On composite numbers n for which a^n == 1 (mod n) for every a prime to n", Scripta Mathematica, Vol. 16 (1950), pp. 133-135. %H A290484 R. G. E. Pinch, <a href="http://s369624816.websitehome.co.uk/rgep/carpsp.html">Tables relating to Carmichael numbers</a>. %H A290484 Carlos Rivera, <a href="http://www.primepuzzles.net/conjectures/conj_019.htm">Conjecture 19, A bound to the largest prime factor of certain Carmichael numbers</a>, The Prime Puzzles and Problems Connection. %e A290484 59 is in the sequence since it is a prime factor of only one 3-Carmichael number: 178837201 = 59 * 1451 * 2089. %Y A290484 Cf. A065091 (Odd primes), A087788 (3-Carmichael numbers), A051663, A290481, A369777. %K A290484 nonn,more %O A290484 1,1 %A A290484 _Amiram Eldar_, Aug 03 2017 %E A290484 a(1)-a(12) were calculated using Pinch's tables of Carmichael numbers (see links). %E A290484 a(13)-a(35) from _Max Alekseyev_, Jan 31 2024