This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A378235 #9 Nov 21 2024 05:22:31 %S A378235 1,1,1,3,4,7,13,23,40,74,148,263,493,934,1719,3192,6035,11280,21252, %T A378235 40367,75796 %N A378235 Number of winning positions of Gordon Hamilton's Jumping Frogs game with single frogs, where the distance between the leftmost frog and the rightmost frog is equal to n. %C A378235 For the rules of the Jumping Frogs game, see A377232. %C A378235 A winning position and its reversal are both counted. %C A378235 a(n) is the number of terms x of A377232 in the interval 2^n <= x < 2^(n+1). %e A378235 For n = 0, the only winning position is 1, so a(0) = 1. %e A378235 For n = 1, the only winning position is 11, so a(1) = 1. %e A378235 For n = 2, the only winning position is 111, so a(2) = 1. %e A378235 For n = 3, there are a(3) = 3 winning positions: 1011, 1101, 1111. %e A378235 For n = 4, there are a(4) = 4 winning positions: 10111, 11011, 11101, 11111. %e A378235 For n = 5, there are a(5) = 7 winning positions: 100111, 101111, 110111, 111001, 111011, 111101, 111111. %Y A378235 Cf. A377232, A378004. %K A378235 nonn,more %O A378235 0,4 %A A378235 _Pontus von Brömssen_, Nov 20 2024