The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A175278 Base-6 pandigital primes: primes having at least one of each digit 0,1,2,3,4,5 when written in base 6. 8
 48761, 50033, 50051, 50069, 50101, 50207, 50231, 50311, 50461, 51131, 51137, 51151, 51461, 51503, 51511, 51721, 52181, 52391, 52541, 52571, 52583, 53731, 53881, 54091, 54121, 55001, 57191, 58481, 58901, 60161, 62591, 62921, 63029 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Terms in this sequence have at least 7 digits in base 6, i.e., are larger than 6^6, since sum(d_i 6^i) = sum(d_i) (mod 5), and 0+1+2+3+4+5 is divisible by 5. So the smallest ones should be of the form "101...." in base 6, where "...." is a permutation of "2345". Actually there is only one such prime, cf. examples. LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 EXAMPLE The smallest base-6 pandigital prime is written "1013425" in base 6. The next smallest such prime is "1023345"[6]; note that here the "3" is repeated, since there is no such prime of the form "102wxyz" with w=0, 1 or 2. (Using the same reasoning as in the comment, it follows that the (7-digit base-6 pandigital) number has the same parity as the repeated digit, which therefore must be odd to get a prime.) MATHEMATICA Select[Range[60000], Min @ DigitCount[#, 6] > 0 && PrimeQ[#] &] (* Amiram Eldar, Apr 13 2021 *) PROG (PARI) base(n, b=6)={ local(a=[n%b]); while(0

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.

Last modified June 13 05:35 EDT 2024. Contains 373366 sequences. (Running on oeis4.)