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 A350636 #9 Jan 12 2022 08:33:26 %S A350636 0,0,0,0,1,1,1,1,3,3,6,7,10,12,17,20,28,34,45,55,72,87,111,133,167, %T A350636 200,247,295,362,431,523,621,749,885,1059,1247,1482,1739,2055,2402, %U A350636 2826,3293,3855,4479,5225,6051,7032,8123,9406,10837,12509,14372,16541,18960,21756,24880,28477 %N A350636 a(n) is the number of partitions of n in which no part is divisible by 3 minus the number of basis partitions of n. %C A350636 Andrews conjectures that a(n)>0 for n>3. %H A350636 Seiichi Manyama, <a href="/A350636/b350636.txt">Table of n, a(n) for n = 0..10000</a> %H A350636 George E. Andrews, <a href="https://hal.archives-ouvertes.fr/hal-03498190/">Partition Identities for Two-Color Partitions</a>, Hardy-Ramanujan Journal, Hardy-Ramanujan Society, 2021, Special Commemorative volume in honour of Srinivasa Ramanujan, 2021, 44, pp.74-80. hal-03498190. See p. 79. %F A350636 a(n) = A000726(n) - A066447(n). %Y A350636 Cf. A000726, A066447. %K A350636 nonn %O A350636 0,9 %A A350636 _Michel Marcus_, Jan 09 2022