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