a(n) is the number of optimal strategies for Player I in the Penney-Ante game with strings of length n.

A344903

a(n) is the number of optimal strategies for Player I in the Penney-Ante game with strings of length n.

Terms

    a(0) =4a(1) =2a(2) =2a(3) =2a(4) =6a(5) =10a(6) =22a(7) =42a(8) =86a(9) =166a(10) =338a(11) =666a(12) =1342a(13) =2662a(14) =5346a(15) =10650a(16) =21342a(17) =42598a(18) =85282a(19) =170398a(20) =340962a(21) =681586a(22) =1363510a(23) =2726354a(24) =5453374a(25) =10905406a(26) =21812154a(27) =43621646a(28) =87245954a(29) =174486562

External references