login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083428 Smallest prime that can be formed using the digits of first 3n+1 numbers, or 0 if no such number exists. 0

%I

%S 1423,1234657,10123457689,10111112233469857,10111111112233445569867,

%T 10111111111112233445566799887,10011111111111122222233445567689987,

%U 10011111111111122222222233344455566879789,10011111111111122222222222233344455566677897889

%N Smallest prime that can be formed using the digits of first 3n+1 numbers, or 0 if no such number exists.

%C The digits of first 3n and first 3n-1 numbers yield a composite number which is a multiple of 3. Conjecture: No entry is zero. Subsidiary sequence: the number of distinct primes that can be formed using the digits of first 3n + 1 numbers.

%K base,nonn

%O 1,1

%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 29 2003

%E a(4)-a(9) from _Donovan Johnson_, Apr 03 2008

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 24 06:30 EDT 2021. Contains 346273 sequences. (Running on oeis4.)