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 A146115 #16 Jun 20 2025 10:43:27 %S A146115 1,1,2,5,15,2,3,2,15,22,0,20,22,12,22,20,22,4,9,7,22,1,23,21,14,3,24, %T A146115 14,5,22,22,3,19,22,24,20,17,16,21,9,17,13,17,10,1,15,5,7,11,6,20,2, %U A146115 13,7,11,12,0,20,13,18,12,20,13,11,20,22,13,9,11,7,20,12,20,8,2,22,7,23,20,4,19 %N A146115 Bell numbers (A000110) read mod 25. %H A146115 G. C. Greubel, <a href="/A146115/b146115.txt">Table of n, a(n) for n = 0..10000</a> %H A146115 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 A146115 <a href="/index/Rec#order_3905">Index entries for linear recurrences with constant coefficients</a>, order 3905. %F A146115 a(n+3905) = a(n). - _G. C. Greubel_, Feb 02 2016 [See A054767. - _Jianing Song_, Jun 20 2025] %t A146115 Mod[BellB[Range[0,80]],25] (* _Harvey P. Dale_, Oct 24 2011 *) %o A146115 (Magma) [Bell(n) mod 25: n in [0..100]]; // _G. C. Greubel_, Feb 02 2016 %Y A146115 Cf. A000110, A146093-A146122 (Bell numbers read mod 3 to mod 32). %Y A146115 Cf. A054767 (periods). %K A146115 nonn %O A146115 0,3 %A A146115 _N. J. A. Sloane_, Feb 07 2009