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