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.

A146099 Bell numbers (A000110) read mod 9.

This page as a plain text file.
%I A146099 #18 Jun 20 2025 12:43:58
%S A146099 1,1,2,5,6,7,5,4,0,6,1,6,4,1,7,5,5,0,4,5,1,6,6,1,6,4,1,1,5,2,6,4,5,4,
%T A146099 6,3,1,6,1,1,1,2,5,6,7,5,4,0,6,1,6,4,1,7,5,5,0,4,5,1,6,6,1,6,4,1,1,5,
%U A146099 2,6,4,5,4,6,3,1,6,1,1,1,2,5,6,7,5,4,0,6,1,6,4,1,7,5,5,0,4,5,1,6,6,1,6,4,1
%N A146099 Bell numbers (A000110) read mod 9.
%H A146099 G. C. Greubel, <a href="/A146099/b146099.txt">Table of n, a(n) for n = 0..10000</a>
%H A146099 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 A146099 <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 A146099 a(n+39) = a(n). - _G. C. Greubel_, Jan 31 2016 [See A054767. - _Jianing Song_, Jun 20 2025]
%t A146099 Mod[BellB[Range[0, 100]], 9] (* _G. C. Greubel_, Jan 31 2016 *)
%o A146099 (Magma) [Bell(n) mod 9: n in [0..100]]; // _Vincenzo Librandi_, Feb 01 2016
%Y A146099 Cf. A000110, A146093-A146122 (Bell numbers read mod 3 to mod 32).
%Y A146099 Cf. A054767 (periods).
%K A146099 nonn
%O A146099 0,3
%A A146099 _N. J. A. Sloane_, Feb 07 2009