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