login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066416 Number of numbers m such that the sum of the anti-divisors of m is n+1. 2
0, 1, 1, 1, 1, 0, 0, 2, 0, 1, 0, 1, 1, 2, 0, 1, 0, 2, 1, 0, 0, 1, 1, 3, 0, 0, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 0, 1, 1, 1, 3, 0, 0, 0, 2, 0, 1, 0, 1, 0, 3, 0, 1, 1, 3, 1, 3, 0, 1, 0, 0, 0, 2, 0, 1, 0, 0, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 0, 0, 2, 0, 2, 0, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,8

COMMENTS

See A066272 for definition of anti-divisor.

LINKS

Table of n, a(n) for n=1..88.

Jon Perry, Anti-divisor

Jon Perry, The Anti-divisor [Cached copy]

Jon Perry, The Anti-divisor: Even More Anti-Divisors [Cached copy]

EXAMPLE

8 has anti-divisors 1, 3 and 5, whose sum is 9 and 9 has anti-divisors 1, 2 and 6, whose sum is 9 and there are no others. Therefore a(8)=2.

CROSSREFS

Cf. A066417, A066418, A058838, A066241.

Sequence in context: A328616 A260736 A293896 * A292342 A091991 A108234

Adjacent sequences:  A066413 A066414 A066415 * A066417 A066418 A066419

KEYWORD

nonn,more

AUTHOR

Jon Perry, Dec 28 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 31 03:48 EDT 2020. Contains 333136 sequences. (Running on oeis4.)