a(n) = (conjectured) length of longest string that can be generated by a starting string of 2's and 3's of length n, using the rule described in the Comments lines.
A094004
a(n) = (conjectured) length of longest string that can be generated by a starting string of 2's and 3's of length n, using the rule described in the Comments lines.
Terms
- a(0) =1a(1) =4a(2) =5a(3) =8a(4) =9a(5) =14a(6) =15a(7) =66a(8) =68a(9) =70a(10) =123a(11) =124a(12) =125a(13) =132a(14) =133a(15) =134a(16) =135a(17) =136a(18) =138a(19) =139a(20) =140a(21) =142a(22) =143a(23) =144a(24) =145a(25) =146a(26) =147a(27) =148a(28) =149a(29) =150
External references
- oeis: A094004