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