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