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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036431 a(n) = number of positive integers b which, when added to the number of their divisors, tau(b), gives n. 1
0, 1, 0, 1, 1, 0, 2, 0, 1, 1, 0, 2, 1, 1, 1, 0, 0, 2, 2, 0, 2, 0, 0, 1, 2, 2, 0, 1, 0, 1, 2, 1, 1, 1, 0, 0, 1, 3, 2, 0, 0, 1, 2, 0, 2, 0, 0, 1, 1, 3, 1, 1, 0, 0, 2, 1, 0, 2, 1, 0, 2, 2, 1, 1, 0, 1, 0, 0, 3, 0, 1, 1, 2, 2, 1, 0, 0, 2, 0, 0, 3, 1, 0, 1, 1, 3, 3, 0, 0, 1, 2, 2, 0, 0, 0, 1, 2, 1, 2, 2 (list; graph; refs; listen; history; internal format)
OFFSET

0,7

COMMENTS

Invented by the HR concept formation program.

LINKS

S. Colton, Refactorable Numbers - A Machine Invention, J. Integer Sequences, Vol. 2, 1999, #2.

S. Colton, HR - Automatic Theory Formation in Pure Mathematics

FORMULA

a(n) = |{b in N : b + tau(b) = n}|

EXAMPLE

a(7) = 2 because (i) 4+tau(4)=7 and (ii) 5+tau(5)=7.

CROSSREFS

Cf. A036432.

Sequence in context: A140080 A065359 A087372 * A029407 A099544 A036414

Adjacent sequences:  A036428 A036429 A036430 * A036432 A036433 A036434

KEYWORD

nonn

AUTHOR

Simon Colton (simonco(AT)cs.york.ac.uk)

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.