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