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 A036485 #13 Aug 01 2025 06:36:35 %S A036485 1,1,1,1,1,1,1,1,1,1,2,1,2,2,2,2,2,2,2,2,3,3,3,3,4,4,4,4,4,4,5,5,5,6, %T A036485 6,6,7,7,7,7,8,8,9,9,10,10,0,0,1,1,2,2,3,3,4,5,6,6,7,7,9,9,10,0,1,2,3, %U A036485 4,5,6,8,8,10,0,1,2,4,5,7,8,10,0,2,3,6,7,9,0,2,4,7,8,0,2,5,6,10,1,4,6,10 %N A036485 a(n) = partition(11n) mod 11. %H A036485 Amiram Eldar, <a href="/A036485/b036485.txt">Table of n, a(n) for n = 0..10000</a> %F A036485 a(n) = A020919(11*n). - _Amiram Eldar_, Aug 01 2025 %t A036485 Mod[PartitionsP[11*Range[0,110]],11] (* _Harvey P. Dale_, Feb 09 2015 *) %o A036485 (PARI) a(n) = numbpart(11*n) % 11; \\ _Amiram Eldar_, Aug 01 2025 %Y A036485 Cf. A000041, A020919. %Y A036485 partition(11n+k): this sequence (k=0), A036475 (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 A036485 nonn,easy %O A036485 0,11 %A A036485 _David W. Wilson_ %E A036485 Offset corrected by _Amiram Eldar_, Aug 01 2025