cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A133948 a(n) = the number of "isolated divisors" of n(n+1). A positive divisor, k, of n is isolated if neither (k-1) nor (k+1) divides n.

This page as a plain text file.
%I A133948 #13 Sep 16 2015 13:43:42
%S A133948 0,1,2,2,3,3,4,6,5,4,6,6,4,8,12,6,7,7,6,13,9,4,10,16,8,11,16,8,9,9,8,
%T A133948 16,11,12,21,12,4,11,22,10,9,9,8,24,15,4,14,21,14,17,16,8,11,22,22,23,
%U A133948 11,4,16,16,4,17,32,22,23,11,8,18,22,12,16,16,4,17,26,20,21,11,14,37,15,4,16
%N A133948 a(n) = the number of "isolated divisors" of n(n+1). A positive divisor, k, of n is isolated if neither (k-1) nor (k+1) divides n.
%H A133948 Ray Chandler, <a href="/A133948/b133948.txt">Table of n, a(n) for n=1..10000</a>
%F A133948 a(n) = A092517(n) - A133947(n) = A132881(A002378(n)).
%t A133948 Table[Length[Divisors[n*(n + 1)]] - 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 *)
%Y A133948 Cf. A133947, A133950, A092517.
%K A133948 nonn
%O A133948 1,3
%A A133948 _Leroy Quet_, Sep 30 2007
%E A133948 More terms from _Stefan Steinerberger_, Nov 01 2007
%E A133948 Extended by _Ray Chandler_, Jun 23 2008