Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013585
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013585 Smallest m such that 1!+...+m! is divisible by 2n+1, or 0 if no such m exists. +0
2
1, 2, 0, 0, 3, 4, 0, 0, 5, 0, 0, 12, 0, 7, 19, 0, 4, 0, 24, 0, 32, 19, 0, 0, 0, 5, 20, 0, 0, 0, 0, 0, 0, 20, 12, 0, 7, 0, 0, 57, 7, 0, 0, 19, 0, 0, 0, 0, 6, 8, 83, 0, 0, 15, 33, 24, 0, 0, 0, 0, 12, 32, 0, 38, 19, 9, 0, 0, 0, 23, 0, 0, 0, 0, 70, 71, 5, 0, 57, 20, 0, 17, 0, 0, 0, 0, 26, 0, 0, 0, 0, 0, 0, 0, 0, 28 (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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research