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