A146093 Bell numbers (A000110) read mod 3.

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, 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, 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

Offset: 0

Author

N. J. A. Sloane, Feb 07 2009

Keywords

• nonn

Links

• G. C. Greubel, Table of n, a(n) for n = 0..2500
• W. F. Lunnon, P. A. B. Pleasants, and N. M. Stephens, Arithmetic properties of Bell numbers to a composite modulus I, Acta Arithmetica 35 (1979), pp. 1-16.
• Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,0,0,1).

Crossrefs

Cf. A000110, A146094-A146122. A054767 gives periods. See also A002034.

Programs

Magma

[Bell(n) mod 3: n in [0..100]]; // Vincenzo Librandi, Jan 30 2016

Mathematica

Mod[BellB[Range[0,110]],3] (* Harvey P. Dale, Oct 31 2013 *)

Formula

a(n+13) = a(n). - G. C. Greubel, Jan 30 2016