This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A133947 a(n) = the number of "non-isolated divisors" of n(n+1). A positive divisor, k, of n is non-isolated if (k-1) or (k+1) also divides n. 3
 2, 3, 4, 4, 5, 5, 4, 6, 7, 4, 6, 6, 4, 8, 8, 4, 5, 5, 6, 11, 7, 4, 6, 8, 4, 5, 8, 4, 7, 7, 4, 8, 5, 4, 15, 6, 4, 5, 10, 6, 7, 7, 4, 12, 9, 4, 6, 9, 4, 7, 8, 4, 5, 10, 10, 9, 5, 4, 8, 8, 4, 7, 10, 6, 9, 5, 4, 6, 10, 4, 8, 8, 4, 7, 10, 4, 11, 5, 6, 13, 5, 4, 8, 15, 4, 5, 8, 4, 9, 13, 6, 6, 5, 4, 12, 6, 4, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Ray Chandler, Table of n, a(n) for n=1..10000 FORMULA a(n) = A092517(n) - A133948(n) = A132747(A002378(n)). MATHEMATICA Table[Length[Select[Divisors[n*(n + 1)], If[ # > 1, Mod[n*(n + 1), #*(# - 1)] == 0] || Mod[n*(n + 1), #*(# + 1)] == 0 &]], {n, 1, 80}] (* Stefan Steinerberger, Nov 01 2007 *) CROSSREFS Cf. A133948, A133949, A092517. Sequence in context: A306574 A088527 A030602 * A082090 A060197 A116487 Adjacent sequences:  A133944 A133945 A133946 * A133948 A133949 A133950 KEYWORD nonn AUTHOR Leroy Quet, Sep 30 2007 EXTENSIONS More terms from Stefan Steinerberger, Nov 01 2007 Extended by Ray Chandler, Jun 23 2008 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.

Last modified December 14 19:27 EST 2019. Contains 329987 sequences. (Running on oeis4.)