login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092338 Number of numbers d with n mod d <= 1. 0
1, 2, 3, 4, 4, 5, 5, 5, 6, 6, 5, 7, 7, 5, 7, 8, 6, 7, 7, 7, 9, 7, 5, 9, 10, 6, 7, 9, 7, 9, 9, 7, 9, 7, 7, 12, 10, 5, 7, 11, 9, 9, 9, 7, 11, 9, 5, 11, 12, 8, 9, 9, 7, 9, 11, 11, 11, 7, 5, 13, 13, 5, 9, 12, 10, 11, 9, 7, 9, 11, 9, 13, 13, 5, 9, 11, 9, 11, 9, 11, 14, 8, 5, 13, 15, 7, 7, 11, 9, 13 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(n) = A000005(n) + A032741(n).

CROSSREFS

Sequence in context: A116487 A070546 A034586 * A199769 A030601 A049839

Adjacent sequences:  A092335 A092336 A092337 * A092339 A092340 A092341

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 18 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.