|
%I #20 Dec 14 2023 05:23:04
%S 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,
%T 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,
%U 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
%N Bell numbers (A000110) mod 4.
%H G. C. Greubel, <a href="/A146094/b146094.txt">Table of n, a(n) for n = 0..2500</a>
%H P. Pleasants, W. Lunnon, and N. 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 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,0,0,1).
%F a(n) = a(n-12). - _Charles R Greathouse IV_, Jul 06 2011
%t Mod[BellB[Range[0, 50]], 4] (* _G. C. Greubel_, Jan 30 2016 *)
%o (Magma) [Bell(n) mod 4: n in [0..100]]; // _Vincenzo Librandi_, Jan 30 2016
%Y Cf. A000110, A146093.
%K nonn,easy
%O 0,3
%A _N. J. A. Sloane_, Feb 07 2009
|
