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 A344319 #5 May 14 2021 22:38:47 %S A344319 1,1,2,0,2,2,1,1,1,2,3,0,2,2,1,2,2,2,2,0,3,2,2,2,1,2,3,0,2,3,1,3,2,2, %T A344319 2,0,4,2,1,2,1,3,5,0,2,2,1,3,1,3,3,0,4,3,1,2,2,2,3,0,3,2,2,4,1,3,3,0, %U A344319 3,4,1,2,1,2,4,0,3,3,2,4,2,2,3,0,4,2,1,2,2,4 %N A344319 Number of partitions of n into consecutive parts not divisible by 4. %e A344319 a(11) = 3 because we have [11], [6, 5] and [5, 3, 2, 1]. %Y A344319 Cf. A001227, A001935, A034178, A042968, A344318, A344320. %K A344319 nonn %O A344319 1,3 %A A344319 _Ilya Gutkovskiy_, May 14 2021