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 A146120 #19 Jun 20 2025 08:33:56 %S A146120 1,1,2,5,15,22,23,7,0,27,25,0,7,7,22,5,17,24,19,17,22,21,3,16,9,13,4, %T A146120 19,5,2,27,13,14,7,9,0,7,21,16,19,7,8,17,15,16,5,25,12,21,1,0,7,13,22, %U A146120 11,17,0,25,23,28,27,15,28,21,25,22,13,29,26,27,25,2,25,3,12,7,27,28,25,19,14 %N A146120 Bell numbers (A000110) read mod 30. %H A146120 G. C. Greubel, <a href="/A146120/b146120.txt">Table of n, a(n) for n = 0..10000</a> %H A146120 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 A146120 <a href="/index/Rec#order_30459">Index entries for linear recurrences with constant coefficients</a>, order 30459. %F A146120 a(n+30459) = a(n). - _G. C. Greubel_, Feb 02 2016 [See A054767. - _Jianing Song_, Jun 20 2025] %t A146120 Mod[BellB[Range[0, 100]], 30] (* _G. C. Greubel_, Feb 02 2016 *) %o A146120 (Magma) [Bell(n) mod 30: n in [0..100]]; // _G. C. Greubel_, Feb 02 2016 %Y A146120 Cf. A000110, A146093-A146122 (Bell numbers read mod 3 to mod 32). %Y A146120 Cf. A054767 (periods). %K A146120 nonn %O A146120 0,3 %A A146120 _N. J. A. Sloane_, Feb 07 2009