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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085491 Number of ways to write n as sum of distinct divisors of n+1. 4
1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 5, 0, 0, 0, 1, 0, 3, 0, 1, 0, 0, 0, 5, 0, 0, 0, 3, 0, 2, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 31, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 26, 0, 0, 0, 0, 0, 1, 0, 6, 0, 0, 0, 23, 0, 0, 0, 1, 0, 20, 0, 0, 0, 0, 0, 21, 0, 0, 0, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,11

COMMENTS

a(A085492(n)) = 0; a(A085493(n)) > 0; a(A085494(n)) = 1.

EXAMPLE

n=11, divisors of 12=11+1 that are not greater 11: {1,2,3,4,6},

11=6+5=6+4+1, therefore a(11)=2.

CROSSREFS

Cf. A085496.

Sequence in context: A088183 A070140 A081212 * A116681 A131371 A003475

Adjacent sequences:  A085488 A085489 A085490 * A085492 A085493 A085494

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 03 2003

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 16 10:53 EST 2012. Contains 205904 sequences.