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