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