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 A335060 #24 May 29 2020 11:09:54
%S A335060 0,1,0,2,2,1,2,0,4,4,2,5,6,4,2,3,10,8,6,2,6,9,6,4,8,8,8,4,12,9,10,7,
%T A335060 10,14,10,6,8,14,14,11,12,8,16,10,14,10,16,15,14,14,16,14,12,10,16,11,
%U A335060 18,16,14,22,20,12,12,17,24,18,22,18,22,16,10,19,26,23,18,22,24
%N A335060 a(n) is the number of values of k < n for which 4*(a(k) + a(n-k)) < n.
%H A335060 Samuel B. Reid, <a href="/A335060/b335060.txt">Table of n, a(n) for n = 1..10000</a>
%H A335060 Samuel B. Reid, <a href="/A335060/a335060.c.txt">C program for A335060</a>
%H A335060 Samuel B. Reid, <a href="/A335060/a335060.png">Plot of 2000000 terms</a>
%e A335060 a(6) is 1 because, if (a(k) + a(6-k)) * 4 is less than 6, k can only be 3.
%e A335060 a(9) is 4 because k must be 1, 3, 6, or 8 in order for (a(k) + a(9-k)) * 4 to be less than 9.
%o A335060 (C) See Links section.
%o A335060 (PARI) lista(nn) = {my(va=vector(nn)); for (n=2, nn, va[n] = sum(k=1, n-1, 4*(va[k] + va[n-k]) < n);); va;} \\ _Michel Marcus_, May 22 2020
%Y A335060 Cf. A007306, A272727, A317443.
%K A335060 nonn,look
%O A335060 1,4
%A A335060 _Samuel B. Reid_, May 21 2020