Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013584
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013584 Smallest m such that 0!+1!+...+(m-1)! is divisible by n, or 0 if no such m exists. +0
2
1, 2, 0, 3, 4, 0, 6, 0, 0, 4, 6, 0, 0, 6, 0, 0, 5, 0, 7, 0, 0, 6, 7, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 5, 0, 0, 22, 7, 0, 0, 16, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 55, 12, 0, 0, 0, 0, 0, 0, 0, 0, 54, 0, 42, 22, 0, 0, 6, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)
page 1

Search completed in 0.001 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 December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research