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