|
%I #9 Jan 22 2023 03:01:33
%S 0,0,0,1,0,1,1,0,3,0,2,1,1,3,0,4,0,4,1,1,2,1,3,0,6,0,7,0,8,0,6,2,1,7,
%T 0,8,0,10,0,9,1,7,2,4,4,2,7,1,11,0,15,0,13,1,9,2,7,3,4,7,2,12,0,18,0,
%U 18,1,11,2,9,3,7,5,5,6,4,7,3,10,1,15,0,19
%N a(n) is the number of k > 0 such that n-1-2*k >= 0 and a(n-1-2*k) >= a(n-1-k) + a(n-1).
%H Rémy Sigrist, <a href="/A359867/b359867.txt">Table of n, a(n) for n = 0..10000</a>
%H Rémy Sigrist, <a href="/A359867/a359867.png">Scatterplot of the first 250000 terms</a>
%H Rémy Sigrist, <a href="/A359867/a359867.txt">C program</a>
%e The first terms, alongside the corresponding k's, are:
%e n a(n) k's
%e -- ---- ------------
%e 0 0 {}
%e 1 0 {}
%e 2 0 {}
%e 3 1 {1}
%e 4 0 {}
%e 5 1 {2}
%e 6 1 {1}
%e 7 0 {}
%e 8 3 {1, 2, 3}
%e 9 0 {}
%e 10 2 {2, 3}
%e 11 1 {1}
%e 12 1 {4}
%e 13 3 {1, 2, 3}
%e 14 0 {}
%e 15 4 {2, 3, 5, 7}
%o (C) See Links section.
%Y Cf. A359866.
%K nonn
%O 0,9
%A _Rémy Sigrist_, Jan 16 2023
|
