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 A036476 #14 Aug 01 2025 06:31:11
%S A036476 2,2,2,0,2,2,2,2,2,2,2,2,4,2,4,2,4,4,4,4,4,6,6,4,6,6,6,6,8,8,8,8,10,8,
%T A036476 10,10,1,1,1,1,3,3,5,3,5,5,7,7,9,9,0,0,2,2,4,4,6,6,8,8,1,1,3,3,7,7,9,
%U A036476 9,2,2,6,6,10,10,3,3,7,9,0,2,6,8,1,1,7,9,2,2,8,10,5,7,2,2,8,10,7,9,4,6,3
%N A036476 a(n) = partition(11n+2) mod 11.
%H A036476 Amiram Eldar, <a href="/A036476/b036476.txt">Table of n, a(n) for n = 0..10000</a>
%F A036476 a(n) = A020919(11*n + 2). - _Amiram Eldar_, Aug 01 2025
%t A036476 Table[Mod[PartitionsP[11n+2],11],{n,0,110}] (* _Harvey P. Dale_, Jul 29 2017 *)
%o A036476 (PARI) a(n) = numbpart(11*n + 2) % 11; \\ _Amiram Eldar_, Aug 01 2025
%Y A036476 Cf. A000041, A020919.
%Y A036476 partition(11n+k): A036485 (k=0), A036475 (k=1), this sequence (k=2), A036477 (k=3), A036478 (k=4), A036479 (k=5), A000004 (k=6), A036480 (k=7), A036481 (k=8), A036482 (k=9), A036483 (k=10).
%K A036476 nonn,easy
%O A036476 0,1
%A A036476 _David W. Wilson_
%E A036476 Offset corrected by _Amiram Eldar_, Aug 01 2025