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