

A062406


Cardinality of the (ordered) list L_n defined inductively by: L_1 = {2}; L_(n+1) = L_n  {p}, where p is the first member of L_n, from left to right, such that prime(n+1) can be appended to the end or beginning of p so that the neighboring digits are equal, if p exists; append prime(n+1) to the end of L_n, otherwise.


2



1, 2, 3, 4, 5, 4, 3, 2, 1, 2, 3, 4, 5, 4, 5, 4, 5, 6, 7, 6, 5, 4, 5, 6, 5, 4, 3, 4, 5, 6, 7, 6, 7, 8, 9, 8, 9, 10, 11, 12, 13, 12, 11, 12, 13, 14, 13, 14, 15, 16, 17, 18, 17, 16, 17, 18, 19, 18, 19, 18, 19, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 11, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

It appears that a(n) is growing slowly on the average. (A moving average filter applied to the sequence will show an upward trend.) Probably a(n) > 0 for all n, but lacking a proof, one is never sure. For example, L_9 = {5} comes perilously close to extinction. It would be interesting to have a closedform expression giving, at least asymptotically, the value of a(n).


LINKS



EXAMPLE

L_n for n = 1..5 are: {2}, {2,3}, {2,3,5}, {2,3,5,7}, {2,3,5,7,11}. The first five values of the sequence are then 1,2,3,4,5, respectively. For n = 6, Prime(6) = 13 can be appended to the beginning of 3 in L_5 so that the neighboring digits (i.e., 3's) are equal, so eliminate 3 from L_5 to get L_6 = {2,5,7,11}. Hence a(6) = 4.


PROG

(Sage)
def a_list(n) :
res = []
curlist = []
for m in range(1, n+1) :
d = nth_prime(m).digits()
ds = (d[1], d[0])
remitem = next((i for i in range(len(curlist)) if curlist[i][0] == ds[1] or curlist[i][1] == ds[0]), None)
if remitem != None : del curlist[remitem]
else : curlist.append(ds)
res.append(len(curlist))
return res


CROSSREFS



KEYWORD

nonn,base


AUTHOR



EXTENSIONS

Extended and corrected and definition edited by Eric M. Schmidt, Oct 19 2016


STATUS

approved



