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