# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a232450
Showing 1-1 of 1

%I A232450 #25 Apr 11 2020 06:11:21
%S A232450 16661,1103,1417831,1143749,14282381,11699423,1950071,7503425119,
%T A232450 3837692792387,145857793,76607717987,1755833757671518620617,
%U A232450 17416012536871141,1000000000000066600000000000001,16540928199996367,744657085412168192717253704669
%N A232450 Largest prime factor of the Belphegor number B(n) = (10^(n+3) + 666)*10^(n+1) + 1.
%C A232450 The Belphegor numbers (A232449), though not often prime themselves (see A232448), tend to contain very large prime factors and are therefore hard to factorize.
%H A232450 Stanislav Sykora and Amiram Eldar, <a href="/A232450/b232450.txt">Table of n, a(n) for n = 0..64</a> (terms 0..44 from Stanislav Sykora)
%H A232450 Clifford A. Pickover, <a href="http://sprott.physics.wisc.edu/pickover/pc/1000000000000066600000000000001.html">Belphegor's Prime: 1000000000000066600000000000001</a>
%H A232450 Wikipedia, <a href="http://en.wikipedia.org/wiki/Belphegor%27s_Prime">Belphegor's prime</a>
%t A232450 Table[FactorInteger[(10^(n + 3) + 666)*10^(n + 1) + 1][[-1, 1]], {n, 20}] (* _T. D. Noe_, Nov 25 2013 *)
%o A232450 (PARI) default(factor_proven,1);
%o A232450 Belphegor(k)=(10^(k+3)+666)*10^(k+1)+1;
%o A232450 LargestPrimeFactor(k)={local(f);f=factor(k);return(f[#f[,1],1])};
%o A232450 nmax=40; v=vector(nmax);
%o A232450 for (n=0,#v-1,v[n+1]=LargestPrimeFactor(Belphegor(n));print(v[n+1]))
%Y A232450 Cf. A232448 (indices of Belphegor primes), A232449 (Belphegor numbers).
%K A232450 nonn
%O A232450 0,1
%A A232450 _Stanislav Sykora_, Nov 24 2013

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE