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 A146119 #18 Jun 21 2025 23:53:47 %S A146119 1,1,2,5,15,23,0,7,22,6,4,28,13,13,7,20,28,17,16,20,20,15,5,25,7,24, %T A146119 11,21,18,2,3,7,20,9,23,7,0,28,10,3,12,26,20,27,19,16,4,7,11,6,20,1,3, %U A146119 2,6,3,10,20,5,10,27,0,3,1,7,28,9,13,15,9,17,18,17,6,20,11,18,17,26,21,4,5 %N A146119 Bell numbers (A000110) read mod 29. %C A146119 Conjecture: a(n+91703076898614683377208150526107718802981) = a(n). - _G. C. Greubel_, Feb 02 2016 %C A146119 This is correct, see A054767; the period is (29^29-1)/(29-1). - _Joerg Arndt_, Jun 19 2025 %H A146119 G. C. Greubel, <a href="/A146119/b146119.txt">Table of n, a(n) for n = 0..10000</a> %H A146119 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 A146119 <a href="/index/Rec#order_91703076898614683377208150526107718802981">Index entries for linear recurrences with constant coefficients</a>, order 91703076898614683377208150526107718802981. %t A146119 Mod[BellB[Range[0, 100]], 29] (* _G. C. Greubel_, Feb 02 2016 *) %o A146119 (Magma) [Bell(n) mod 29: n in [0..100]]; // _G. C. Greubel_, Feb 02 2016 %Y A146119 Cf. A000110, A146093-A146122 (Bell numbers read mod 3 to mod 32). %Y A146119 Cf. A054767 (periods). %K A146119 nonn %O A146119 0,3 %A A146119 _N. J. A. Sloane_, Feb 07 2009