%I #14 Nov 13 2019 12:33:59

%S 0,0,1,0,0,2,1,1,2,0,1,1,2,1,2,3,4,1,2,2,4,1,1,3,5,1,1,3,3,3,3,8,3,5,

%T 2,4,2,4,2,4,3,4,4,5,1,4,1,2,4,4,5,3,1,5,5,3,4,5,7,3,5,3,6,8,5,2,4,8,

%U 3,0,6,8,1,3,3,10,4,4,9,4,4,7,9,5,3,4,6

%N a(n) is the number of numbers k such that a(n-2*k) = a(n-k) and 0 < n-2*k < n-k < n .

%H Rémy Sigrist, <a href="/A329257/b329257.txt">Table of n, a(n) for n = 1..25000</a>

%H Rémy Sigrist, <a href="/A329257/a329257.txt">C program for A329257</a>

%H Rémy Sigrist, <a href="/A329257/a329257.png">Colored scatterplot of the first 250000 terms</a> (where the color denotes the parity of n)

%e The first terms, alongside the corresponding k's, are:

%e n a(n) k's

%e --- ---- ------------

%e 1 0 {}

%e 2 0 {}

%e 3 1 {1}

%e 4 0 {}

%e 5 0 {}

%e 6 2 {1, 2}

%e 7 1 {3}

%e 8 1 {3}

%e 9 2 {1, 4}

%e 10 0 {}

%e 11 1 {4}

%e 12 1 {3}

%e 13 2 {1, 5}

%e 14 1 {3}

%e 15 2 {4, 5}

%e 16 3 {2, 4, 6}

%e 17 4 {2, 3, 4, 5}

%o (C) See Links section.

%Y See A329310 and A329311 for similar sequences.

%Y Cf. A317922.

%K nonn,look

%O 1,6

%A _Rémy Sigrist_, Nov 09 2019