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 A033182 #27 Apr 14 2023 13:55:40
%S A033182 1,0,0,0,0,1,1,0,0,0,1,1,1,0,0,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,2,1,1,1,
%T A033182 1,2,2,1,1,1,2,2,2,1,1,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,3,3,2,
%U A033182 2,2,3,3,3,2,2,3,3,3,3,2,3,3,3,3,3,3,3
%N A033182 Number of pairs (p,q) such that 5*p + 6*q = n.
%C A033182 Number of partitions of n into parts 5 and 6. - _Seiichi Manyama_, Jun 14 2017
%H A033182 Seiichi Manyama, <a href="/A033182/b033182.txt">Table of n, a(n) for n = 0..10000</a> (terms 0..1000 from Vincenzo Librandi)
%H A033182 A. V. Kitaev and A. Vartanian, <a href="https://arxiv.org/abs/2304.05671">Algebroid Solutions of the Degenerate Third Painlevé Equation for Vanishing Formal Monodromy Parameter</a>, arXiv:2304.05671 [math.CA], 2023. See p. 20.
%F A033182 a(n) = [ 5*n/6 ] + 1 + [ -4*n/5 ].
%F A033182 a(n) = floor(n/5) - floor((n-1)/6). - _Mircea Merca_, Oct 11 2013
%t A033182 nn = 86; t = Table[0, {nn}]; Do[m = 5*p + 6*q; If[0 < m <= nn, t[[m]]++], {p, 0, nn/5}, {q, 0, nn/6}]; Join[{1}, t] (* _T. D. Noe_, Oct 07 2013 *)
%o A033182 (Magma) [Floor(n/5)-Floor((n-1)/6): n in [0..100]]; // _Vincenzo Librandi_, Oct 13 2013
%Y A033182 Cf. A033183.
%K A033182 nonn
%O A033182 0,31
%A A033182 Michel Tixier (tixier(AT)dyadel.net)