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 A146122 #21 Jun 20 2025 08:08:24 %S A146122 1,1,2,5,15,20,11,13,12,27,7,10,29,21,26,17,3,12,15,1,12,15,27,26,9, %T A146122 25,18,13,7,4,3,5,12,19,31,10,5,13,10,25,27,28,7,25,12,7,19,26,17,17, %U A146122 2,21,31,20,27,29,12,11,23,10,13,5,26,1,19,12,31,17,12,31,11,26,25,9,18,29,23 %N A146122 Bell numbers (A000110) read mod 32. %H A146122 G. C. Greubel, <a href="/A146122/b146122.txt">Table of n, a(n) for n = 0..10000</a> %H A146122 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 A146122 <a href="/index/Rec#order_96">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1). %F A146122 a(n) = a(n-96). [See A054767. - _Jianing Song_, Jun 20 2025] %t A146122 Mod[BellB[Range[0, 100]], 32] (* _G. C. Greubel_, Feb 02 2016 *) %o A146122 (Magma) [Bell(n) mod 32: n in [0..100]]; // _G. C. Greubel_, Feb 02 2016 %Y A146122 Cf. A000110, A146093-A146121 (Bell numbers read mod 3 to mod 31). %Y A146122 Cf. A054767 (periods). %K A146122 nonn,easy %O A146122 0,3 %A A146122 _N. J. A. Sloane_, Feb 07 2009