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 A380189 #8 Jan 16 2025 20:29:53 %S A380189 0,1,0,2,0,1,1,2,1,0,3,1,0,2,0,2,2,2,2,3,3,3,1,0,3,2,3,3,4,5,4,4,4,3, %T A380189 3,3,2,2,2,3,6,6,6,6,8,7,6,5,5,5,4,4,2,1,0,3,1,0,2,0,2,2,3,5,7,7,6,5, %U A380189 4,5,5,6,3,2,2,1,1,4,3,1,2,3,2,4,3,4,4 %N A380189 a(n) is the number of coincidences of the first n terms of this sequence and the first n terms of A380188 in reverse order, i.e., the number of equalities a(k) = A380188(n-1-k) for 0 <= k < n. %H A380189 Pontus von Brömssen, <a href="/A380189/b380189.txt">Table of n, a(n) for n = 0..20000</a> %e A380189 For n = 7, the first 7 terms of this sequence and the first 7 terms of A380188 in reverse order are: %e A380189 0, 1, 0, 2, 0, 1, 1 %e A380189 3, 3, 3, 2, 2, 1, 0 %e A380189 ^ ^ %e A380189 with 2 coincidences, so a(7) = 2. %Y A380189 Cf. A272727, A276638, A379266, A380188, A380190. %K A380189 nonn,look %O A380189 0,4 %A A380189 _Pontus von Brömssen_, Jan 15 2025