Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110265
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110265 Smallest number greater than 1 that can't be written as floor(n/i)+floor(n/j), 1<=i<=j<=n. +0
2
5, 3, 7, 5, 10, 7, 7, 9, 9, 9, 11, 11, 12, 11, 14, 14, 14, 14, 17, 16, 17, 17, 17, 19, 20, 20, 20, 20, 23, 23, 23, 23, 24, 17, 26, 26, 27, 27, 27, 27, 30, 30, 31, 32, 23, 23, 23, 34, 25, 36, 35, 35, 35, 35, 38, 40, 29, 29, 29, 29, 29, 29, 43, 43, 43, 43, 32, 33, 32, 32, 35, 35 (list; graph; listen)
OFFSET

2,1

CROSSREFS

Cf. A110261.

Sequence in context: A096635 A021953 A099408 this_sequence A021190 A109694 A135765

Adjacent sequences: A110262 A110263 A110264 this_sequence A110266 A110267 A110268

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jul 18 2005

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research