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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111861 a(n) is the number of integers of the form (n+k)/(n-k)^2 for k>0. 0
1, 2, 2, 5, 2, 4, 4, 4, 2, 4, 4, 4, 3, 4, 3, 7, 2, 4, 3, 4, 2, 7, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 2, 6, 3, 5, 4, 4, 3, 6, 3, 4, 4, 4, 2, 6, 3, 4, 3, 4, 3, 6, 2, 4, 3, 6, 2, 6, 3, 4, 5, 4, 3, 4, 2, 5, 6, 4, 3, 6, 4, 4, 2, 4, 3, 6, 2, 5, 6, 4, 2, 4, 3, 4, 3, 5, 3, 6, 2, 4, 4, 6, 3, 6, 3, 5, 3, 4, 3, 4, 3, 4, 4, 4, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

First occurrence of n [0,500] is at a(k): 0,1,12,5,3,33,15,210,105, ..., . - Robert G. Wilson v (rgwv(at)rgwv.com), Nov 23 2005

EXAMPLE

For n=14 we have integer value for the form when k={13; 15; 18} and (14+k)/(14-k)^2 = {27, 29, 2}. Thus a(14) = 3

MATHEMATICA

f[n_] := Length[Select[(n + #)/(n - #)^2 & /@ Range[n^2 + 3], IntegerQ[ # ] &]]; Array[f, 105] (* Robert G. Wilson v *)

CROSSREFS

Cf. A111150, A111164.

Sequence in context: A133501 A124316 A061034 * A004543 A153078 A076200

Adjacent sequences:  A111858 A111859 A111860 * A111862 A111863 A111864

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (paoloplava(AT)gmail.com), Nov 22 2005

EXTENSIONS

Corrected and extended by Robert G. Wilson v (rgwv(at)rgwv.com), Nov 23 2005

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 20:38 EST 2012. Contains 205962 sequences.