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.
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.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =4a(4) =5a(5) =4a(6) =3a(7) =2a(8) =1a(9) =2a(10) =3a(11) =4a(12) =5a(13) =4a(14) =5a(15) =4a(16) =5a(17) =6a(18) =7a(19) =6a(20) =5a(21) =4a(22) =5a(23) =6a(24) =5a(25) =4a(26) =3a(27) =4a(28) =5a(29) =6
External references
- oeis: A062406