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 A216023 #14 Feb 16 2025 08:33:18 %S A216023 645,1105,1905,2465,10585,11305,16705,18705,34945,39865,41665,55245, %T A216023 62745,72885,74665,83665,107185,121465,208465,215265,223345,266305, %U A216023 278545,449065,451905,464185,493885,588745,743665,757945,800605,825265,831405,898705,1050985 %N A216023 Fermat pseudoprimes to base 2 divisible by 5. %C A216023 Many Fermat pseudoprimes to base 2 divisible by 5 have one of the following four properties: %C A216023 (1) the sum of their prime factors is divisible by the sum of their digits: %C A216023 for 1105 = 3*5*17 we have 35 divisible by 15; %C A216023 for 1905 = 3*5*127 we have 135 divisible by 15; %C A216023 for 2465 = 5*17*29 we have 51 divisible by 17; %C A216023 for 34945 = 5*29*241 we have 275 divisible by 25; %C A216023 for 62745 = 3*5*47*89 we have 144 divisible by 24; %C A216023 for 107185 = 3*5*47*89 we have 132 divisible by 22; %C A216023 for 223345 = 5*19*2351 we have 2375 divisible by 19; %C A216023 for 451905 = 3*5*47*641 we have 696 divisible by 24. %C A216023 (2) the sum of their prime factors is divisible by 5 (1105, 1905, 16705, 18705, 34945, 223345, 757945, 800605). %C A216023 (3) the sum of their digits is divisible by 5 (645, 1905, 11305, 34945, 72885, 208465, 72885); %C A216023 (4) they are Harshad numbers (645, 1905, 2465, 223345, 757945). %C A216023 Interesting is that the first property is found to other squarefree numbers, not Fermat pseudoprimes, divisible by 5 (e.g., for 1505 = 5*7*43 we have 55 divisible by 11, for 2555 = 5*7*73 we have 85 divisible by 17). It looks like it's a property which deserves further study. %C A216023 Note: the four properties from above are also found to other Fermat pseudoprimes to base 2, but not in this high density (taking, for the second and third properties, a prime factor beside 5 and not considering for the third property the prime factor 3, because would be obviously satisfied). %H A216023 Charles R Greathouse IV, <a href="/A216023/b216023.txt">Table of n, a(n) for n = 1..10000</a> %H A216023 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PouletNumber.html">Poulet Number</a> %H A216023 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HarshadNumber.html">Harshad Number</a> %H A216023 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SumofPrimeFactors.html">Sum of Prime Factors</a> %H A216023 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/DigitSum.html">Digit Sum</a> %t A216023 Select[5*Range[2, 210200], PowerMod[2, # - 1, #] == 1 &] (* _T. D. Noe_, Aug 31 2012 *) %o A216023 (PARI) Korselt(n)=my(f=factor(n)); for(i=1, #f[, 1], if(f[i, 2]>1||(n-1)%(f[i, 1]-1), return(0))); 1 %o A216023 list(lim)=my(v=List()); forstep(n=645, lim, 20, if(Korselt(n), listput(v, n))); Vec(v) \\ _Charles R Greathouse IV_, Jun 30 2017 %Y A216023 Cf. A001567. %K A216023 nonn %O A216023 1,1 %A A216023 _Marius Coman_, Aug 30 2012