cp's OEIS Frontend

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.

A083182 Greatest 3-brilliant number of size n.

This page as a plain text file.
%I A083182 #6 Jul 09 2023 02:16:27
%S A083182 8,98,343,9971,99937,912673,9999707,99999667,991026973,9999999467,
%T A083182 99999999007,991921850317,9999999994771,99999999994117,
%U A083182 999730024299271,9999999999997097,99999999999992023,999949000866995087
%N A083182 Greatest 3-brilliant number of size n.
%C A083182 Brilliant numbers, as defined by Peter Wallrodt, are numbers with two prime factors of the same length (in decimal notation). These numbers are generally used for cryptographic purposes and for testing the performance of prime factoring programs.
%C A083182 a(3n) will always be the cube of the greatest prime less than 10^n.
%H A083182 Dario Alpern, <a href="https://www.alpertron.com.ar/BRILLIANT.HTM">Brilliant numbers</a>
%e A083182 a(5) = 99937 = 37 * 37 * 73 and there is no greater number of five digits which has three prime factors, not necessarily different, of the same size in decimal notation.
%Y A083182 Cf. A083128.
%K A083182 nonn,base
%O A083182 1,1
%A A083182 _Robert G. Wilson v_, May 11 2003