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 A020919 #24 Aug 01 2025 06:29:06 %S A020919 1,1,2,3,5,7,0,4,0,8,9,1,0,2,3,0,0,0,0,6,0,0,1,1,2,0,5,7,0,0,5,0,0,1, %T A020919 1,0,3,0,0,0,4,0,0,0,1,1,2,3,5,0,0,0,0,8,0,1,0,2,0,0,7,0,0,6,0,9,1,1, %U A020919 2,3,5,7,0,4,0,0,9,1,0,2,3,0,0,0,0,0,8,0,1,1,2,3,5,7,0,4,0,8,0,1,1,2,3,5,0 %N A020919 Partition numbers mod 11. %C A020919 Zeros are uncommonly dense at beginning of sequence, no other modulus exhibits this behavior. %H A020919 Amiram Eldar, <a href="/A020919/b020919.txt">Table of n, a(n) for n = 0..10000</a> %F A020919 a(n) = A000041(n) mod 11. - _Sean A. Irvine_, May 04 2019 %t A020919 Mod[PartitionsP[Range[0,120]],11] (* _Harvey P. Dale_, May 14 2023 *) %o A020919 (PARI) a(n) = numbpart(n) % 11; \\ _Michel Marcus_, Jul 14 2022 %Y A020919 Cf. A000041, A040051, A068907, A068908, A020919. %K A020919 nonn,easy %O A020919 0,3 %A A020919 _David W. Wilson_