|
Search: id:A083428
|
|
|
| A083428 |
|
Smallest prime that can be formed using the digits of first 3n+1 numbers, or 0 if no such number exists. |
|
+0
1
|
|
| 1423, 1234657, 10123457689, 10111112233469857, 10111111112233445569867, 10111111111112233445566799887, 10011111111111122222233445567689987, 10011111111111122222222233344455566879789, 10011111111111122222222222233344455566677897889
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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.
|
|
CROSSREFS
|
Sequence in context: A045127 A023937 A068896 this_sequence A068572 A094230 A060364
Adjacent sequences: A083425 A083426 A083427 this_sequence A083429 A083430 A083431
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Apr 29 2003
|
|
EXTENSIONS
|
a(4)-a(9) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Apr 03 2008
|
|
|
Search completed in 0.002 seconds
|
