a(n) = cardinality of the (ordered) list L_n defined inductively by: L_1 = {2}; if, reading from left to right, there is a member p of L_n such that prime(n+1) can be appended to the beginning or end of p so that their neighboring digits are equal, then append prime(n+1) to the beginning or end of p to obtain L_(n+1); otherwise, add prime(n+1) to the end of the list L_n to obtain L_(n+1).
A067854
a(n) = cardinality of the (ordered) list L_n defined inductively by: L_1 = {2}; if, reading from left to right, there is a member p of L_n such that prime(n+1) can be appended to the beginning or end of p so that their neighboring digits are equal, then append prime(n+1) to the beginning or end of p to obtain L_(n+1); otherwise, add prime(n+1) to the end of the list L_n to obtain L_(n+1).
Terms
- a(0) =1a(1) =2a(2) =3a(3) =4a(4) =5a(5) =5a(6) =5a(7) =5a(8) =5a(9) =6a(10) =6a(11) =6a(12) =6a(13) =7a(14) =8a(15) =8a(16) =9a(17) =9a(18) =10a(19) =10a(20) =10a(21) =10a(22) =11a(23) =12a(24) =12a(25) =12a(26) =12a(27) =12a(28) =13a(29) =14
External references
- oeis: A067854