cp's OEIS Frontend

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.

A146096 Bell numbers (A000110) read mod 6.

This page as a plain text file.
%I A146096 #20 Jun 20 2025 14:24:34
%S A146096 1,1,2,5,3,4,5,1,0,3,1,0,1,1,4,5,5,0,1,5,4,3,3,4,3,1,4,1,5,2,3,1,2,1,
%T A146096 3,0,1,3,4,1,1,2,5,3,4,5,1,0,3,1,0,1,1,4,5,5,0,1,5,4,3,3,4,3,1,4,1,5,
%U A146096 2,3,1,2,1,3,0,1,3,4,1,1,2,5,3,4,5,1,0,3,1,0,1,1,4,5,5,0,1,5,4,3,3,4,3,1,4
%N A146096 Bell numbers (A000110) read mod 6.
%H A146096 G. C. Greubel, <a href="/A146096/b146096.txt">Table of n, a(n) for n = 0..2500</a>
%H A146096 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 A146096 <a href="/index/Rec#order_39">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1).
%F A146096 a(n+39) = a(n), for n>=0. - _G. C. Greubel_, Jan 30 2016 [See A054767. - _Jianing Song_, Jun 20 2025]
%t A146096 Mod[BellB[Range[0, 50]], 6] (* _G. C. Greubel_, Jan 30 2016 *)
%o A146096 (Magma) [Bell(n) mod 6: n in [0..100]]; // _Vincenzo Librandi_, Jan 30 2016
%Y A146096 Cf. A000110, A146093-A146122 (Bell numbers read mod 3 to mod 32).
%Y A146096 Cf. A054767 (periods).
%K A146096 nonn
%O A146096 0,3
%A A146096 _N. J. A. Sloane_, Feb 07 2009