|
| |
|
|
A217681
|
|
a(n) produces only composites by concatenating numbers decremented in sequence in all bases from 2 up to a record.
|
|
3
|
| |
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
A217682(n) gives the value of the first arithmetic base in which any prime may be found leading with A217681(n) and proceeding by the concatenation of numbers decreasing in sequence. The simplest example of the kind of prime that needs to be found is 43, but of course we see from this sequence that in binary there is a prime in the set {10011, 1001110, 10011101} (The sequence does not consider the improper 'concatenation' of just the stem value alone), so our decimal 43 never is considered.
a(9)=9221 required 2-to-3 month-windows using a 32-bit version of PARI/GP (incl. the ispseudoprime() function --not isprime()-- a powerful PROBABLE prime test) to verify.
|
|
|
LINKS
|
Table of n, a(n) for n=1..9.
|
|
|
EXAMPLE
|
Binary has a prime of the kind sought for every stem value 2-9, but every value in {10101001, 101010011000, 101010011000111, 101010011000111110, 101010011000111110101, 101010011000111110101100, 1010100110011111010110011, 1010100110001111101011001110, 10101001100011111010110011101} in binary is composite, so that 10 is this sequence's second term (and the companion sequence tells in what base a prime is first found).
|
|
|
CROSSREFS
|
Cf. A217682.
Sequence in context: A160773 A217191 A190043 * A102340 A293931 A047043
Adjacent sequences: A217678 A217679 A217680 * A217682 A217683 A217684
|
|
|
KEYWORD
|
nonn,base,less
|
|
|
AUTHOR
|
James G. Merickel, Oct 10 2012
|
|
|
EXTENSIONS
|
a(9) added by James G. Merickel, May 02 2013
|
|
|
STATUS
|
approved
|
| |
|
|
