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