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 A146110 #16 Jun 20 2025 11:18:54 %S A146110 1,1,2,5,15,12,3,17,0,7,15,10,17,17,2,5,7,4,19,17,12,11,3,6,9,13,14,9, %T A146110 15,12,7,13,4,7,19,10,17,1,6,9,7,8,7,5,16,15,15,2,1,1,10,17,3,12,11, %U A146110 17,0,15,3,18,17,5,18,1,15,12,3,9,16,7,15,2,5,13,2,17,7,8,15,9,4,15,3,14,13,9,18 %N A146110 Bell numbers (A000110) read mod 20. %H A146110 G. C. Greubel, <a href="/A146110/b146110.txt">Table of n, a(n) for n = 0..10000</a> %H A146110 W. F. Lunnon, P. A. B. Pleasants, and N. M. Stephens, <a href="http://matwbn.icm.edu.pl/ksiazki/aa/aa35/aa3511.pdf">Arithmetic properties of Bell numbers to a composite modulus I</a>, Acta Arithmetica 35 (1979), pp. 1-16. %H A146110 <a href="/index/Rec#order_9372">Index entries for linear recurrences with constant coefficients</a>, order 9372. %F A146110 a(n+9372) = a(n). - _G. C. Greubel_, Feb 01 2016 [See A054767. - _Jianing Song_, Jun 20 2025] %t A146110 Mod[BellB[Range[0,90]],20] (* _Harvey P. Dale_, May 12 2012 *) %o A146110 (Magma) [Bell(n) mod 20: n in [0..100]]; // _Vincenzo Librandi_, Feb 02 2016 %Y A146110 Cf. A000110, A146093-A146122 (Bell numbers read mod 3 to mod 32). %Y A146110 Cf. A054767 (periods). %K A146110 nonn %O A146110 0,3 %A A146110 _N. J. A. Sloane_, Feb 07 2009