login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A146093 Bell numbers (A000110) read mod 3. 5
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

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.

FORMULA

a(n) = (1/169)*{2*(n mod 13)-11*[(n+1) mod 13]+15*[(n+2) mod 13]-11*[(n+3) mod 13]+2*[(n+4) mod 13]+15*[(n+5) mod 13]+15*[(n+6) mod 13]-11*[(n+7) mod 13]-11*[(n+8) mod 13]+28*[(n+9) mod 13]+2*[(n+10) mod 13]-11*[(n+11) mod 13]+2*[(n+12) mod 13]}, with n>=0. - Paolo P. Lava, Feb 13 2009

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

MATHEMATICA

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

PROG

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

CROSSREFS

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

Sequence in context: A249371 A122190 A237291 * A091269 A287455 A216789

Adjacent sequences:  A146090 A146091 A146092 * A146094 A146095 A146096

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Feb 07 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 16:03 EDT 2019. Contains 323597 sequences. (Running on oeis4.)