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