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 A153432 #9 Jan 03 2025 23:29:15 %S A153432 15538734736,28034367522,41221375552,89468493268,92220460962, %T A153432 95951017078,105627706800,108012908976,147689513538,161055865908, %U A153432 177073756566,181921823202,185137153012,192336309046,212463686778 %N A153432 Numbers m such that all ten numbers 10^k*m+1; k=0,1,...,9 are prime. %C A153432 If m & n are in the sequence, k<10 and r=m*n*10^k -1 is prime then r has at least k+1 representations of the form p*q-(p+q)where p & q are prime. %H A153432 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_482.htm">Puzzle 482. Two Bergot questions</a>, The Prime Puzzles & Problems Connection. %F A153432 a(n) >> n log^10 n. - _Charles R Greathouse IV_, Dec 29 2024 %Y A153432 Subsequence of A006093 and of A008596. %Y A153432 Cf. A153431, A153433. %K A153432 nonn,more %O A153432 1,1 %A A153432 _Farideh Firoozbakht_, Mar 31 2009