login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A146094
Bell numbers (A000110) mod 4.
7
1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0, 3, 3, 2, 1, 1, 2, 1, 3, 0, 3, 1, 0
OFFSET
0,3
LINKS
P. Pleasants, W. Lunnon, and N. Stephens, Arithmetic properties of Bell numbers to a composite modulus I, Acta Arithmetica 35 (1979), pp. 1-16.
FORMULA
a(n) = a(n-12). - Charles R Greathouse IV, Jul 06 2011
MATHEMATICA
Mod[BellB[Range[0, 50]], 4] (* G. C. Greubel, Jan 30 2016 *)
PROG
(Magma) [Bell(n) mod 4: n in [0..100]]; // Vincenzo Librandi, Jan 30 2016
CROSSREFS
Sequence in context: A004563 A329647 A364235 * A098035 A079055 A122170
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Feb 07 2009
STATUS
approved