login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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.
0

%I #8 Jan 16 2025 20:29:53

%S 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 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 4,5,5,6,3,2,2,1,1,4,3,1,2,3,2,4,3,4,4

%N 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 Pontus von Brömssen, <a href="/A380189/b380189.txt">Table of n, a(n) for n = 0..20000</a>

%e For n = 7, the first 7 terms of this sequence and the first 7 terms of A380188 in reverse order are:

%e 0, 1, 0, 2, 0, 1, 1

%e 3, 3, 3, 2, 2, 1, 0

%e ^ ^

%e with 2 coincidences, so a(7) = 2.

%Y Cf. A272727, A276638, A379266, A380188, A380190.

%K nonn,look

%O 0,4

%A _Pontus von Brömssen_, Jan 15 2025