login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323745 a(n) is the smallest prime that becomes composite if any single digit of its base-n expansion is changed to a different digit (but not to zero). 2

%I #22 Mar 25 2024 16:37:15

%S 3,2,89,67,28151,223,6211,2789,294001,701,8399011,2423,691063,243367,

%T 527099,10513,2078920243,10909,169402249,2114429,156760543,68543,

%U 96733308587,181141,121660507,6139219,3141223681,114493

%N a(n) is the smallest prime that becomes composite if any single digit of its base-n expansion is changed to a different digit (but not to zero).

%C This sequence has several terms in common with A186995; if the restriction that no digit can be changed to zero were removed, A186995 would result.

%C a(30) > 10^10.

%C The next few terms after a(30) are 356479, 860343287, 399946711, ...

%F a(n) <= A186995(n). - _Chai Wah Wu_, Mar 25 2024

%e a(2)=3 because 3 is prime and its base-2 expansion is 11_2, which cannot have either of its digits changed to a nonzero digit, whereas the only smaller prime, i.e., 2 = 10_2, yields another prime if its 0 digit is changed to a 1.

%e a(3)=2 because 2 = 2_3 is prime and, in base 3, the only way to change its digit to another (nonzero) digit is to change it to 1_3 = 1, which is nonprime.

%e a(4)=89 because 89 = 1121_4 is prime, every number that can be obtained by changing one of its digits to another (nonzero) digit is nonprime (1122_4=90, 1123_4=91, 1111_4=85, 1131_4=93, 1221_4=105, 1321_4=121, 2121_4=153, 3121_4=217), and there is no prime smaller than 89 that has this property.

%e a(18)=2078920243 because 2078920243 = 3723de91_18 (where the letters d and e represent the base-18 digits whose values are 13 and 14, respectively), and each of the 128 other base-18 numbers that can be obtained by changing one of its eight digits to another (nonzero) digit is nonprime, and no smaller prime has this property.

%o (Python)

%o from sympy import isprime, nextprime

%o from sympy.ntheory import digits

%o def A323745(n):

%o p = 2

%o while True:

%o m = 1

%o for j in digits(p,n)[:0:-1]:

%o for k in range(1,n):

%o if k!=j and isprime(p+(k-j)*m):

%o break

%o else:

%o m *= n

%o continue

%o break

%o else:

%o return p

%o p = nextprime(p) # _Chai Wah Wu_, Mar 25 2024

%Y Cf. A186995.

%K nonn,base,more

%O 2,1

%A _Jon E. Schoenfield_, May 04 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 04:35 EDT 2024. Contains 371782 sequences. (Running on oeis4.)