Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A166226
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A166226 Bell number n modulo n +0
1
0, 0, 2, 3, 2, 5, 2, 4, 6, 5, 2, 1, 2, 12, 5, 3, 2, 13, 2, 12, 15, 5, 2, 9, 3, 18, 10, 3, 2, 27, 2, 12, 4, 5, 0, 1, 2, 24, 28, 27, 2, 23, 2, 8, 5, 5, 2, 33, 24, 20 (list; graph; listen)
OFFSET

1,3

COMMENT

a(n) = 2 (mod n) when n is prime

FORMULA

a(n) = A000110(n) mod n

EXAMPLE

a(3)=a(5)=a(7)=a(11)=2

CROSSREFS

See the Bell numbers sequence A000110

Sequence in context: A000705 A073751 A108501 this_sequence A088167 A073893 A099552

Adjacent sequences: A166223 A166224 A166225 this_sequence A166227 A166228 A166229

KEYWORD

nonn,more

AUTHOR

Thierry Banel (tbanel(AT)gmail.com), Oct 09 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research