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 A146093 #23 Jun 20 2025 10:24:15 %S A146093 1,1,2,2,0,1,2,1,0,0,1,0,1,1,1,2,2,0,1,2,1,0,0,1,0,1,1,1,2,2,0,1,2,1, %T A146093 0,0,1,0,1,1,1,2,2,0,1,2,1,0,0,1,0,1,1,1,2,2,0,1,2,1,0,0,1,0,1,1,1,2, %U A146093 2,0,1,2,1,0,0,1,0,1,1,1,2,2,0,1,2,1,0,0,1,0,1,1,1,2,2,0,1,2,1,0,0,1,0,1,1 %N A146093 Bell numbers (A000110) read mod 3. %H A146093 G. C. Greubel, <a href="/A146093/b146093.txt">Table of n, a(n) for n = 0..2500</a> %H A146093 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 A146093 <a href="/index/Rec#order_13">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,0,0,0,1). %F A146093 a(n+13) = a(n). - _G. C. Greubel_, Jan 30 2016 %t A146093 Mod[BellB[Range[0,110]],3] (* _Harvey P. Dale_, Oct 31 2013 *) %o A146093 (Magma) [Bell(n) mod 3: n in [0..100]]; // _Vincenzo Librandi_, Jan 30 2016 %Y A146093 Cf. A000110, A146094-A146122. A054767 gives periods. See also A002034. %K A146093 nonn %O A146093 0,3 %A A146093 _N. J. A. Sloane_, Feb 07 2009