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