Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059751
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059751 Grimm numbers (2): a(n) = largest k so that for each composite m in {n+1, n+2, ..., n+k} there corresponds a different divisor d_m with 1 < d_m < m. +0
3
7, 6, 5, 10, 9, 14, 13, 12, 15, 22, 21, 20, 19, 20, 23, 22, 21, 20, 19, 18, 27, 26, 25, 24, 29, 30, 29, 28, 27, 26, 25, 24, 31, 34, 41, 40, 39, 46, 47, 46, 45, 44, 43, 42, 41, 44, 43, 42, 43, 42, 43, 42, 41, 40, 55, 54, 53, 60, 59, 58, 57, 58, 57, 56, 57, 56, 55, 54, 59, 58, 57 (list; graph; listen)
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 December 4 08:07 EST 2009. Contains 170310 sequences.


AT&T Labs Research