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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051521 Number of ways to represent n as k/d(k). 4
2, 2, 3, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 1, 1, 1, 2, 2, 3, 1, 0, 2, 2, 0, 2, 1, 1, 1, 1, 1, 2, 1, 1, 3, 2, 1, 2, 2, 0, 1, 2, 2, 3, 1, 1, 2, 2, 3, 1, 2, 1, 1, 2, 1, 2, 1, 0, 0, 1, 1, 2, 2, 1, 1, 2, 0, 2, 1, 1, 2, 1, 1, 2, 2, 2, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 0, 1, 2, 1, 2, 2, 0, 1, 2, 1, 2, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a(A036763(n)) = 0; a(A051278(n)) = 1; a(A0512789(n)) = 2. [Reinhard Zumkeller, Dec 28 2011]

PROG

(Haskell)

a051521 n = length [k | k <- [1..4*n^2],

                        let d = a000005 k, divMod k d == (n, 0)]

-- Reinhard Zumkeller, Dec 28 2011

CROSSREFS

Sequence in context: A195663 A071435 A119428 * A171810 A097028 A092331

Adjacent sequences:  A051518 A051519 A051520 * A051522 A051523 A051524

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 06:46 EST 2012. Contains 205867 sequences.