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