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.

A140774 Consider the products of all pairs of consecutive (when ordered by size) positive divisors of n. a(n) = the number of these products that divide n. a(n) also = the number of the products that are divisible by n.

This page as a plain text file.
%I A140774 #17 Mar 06 2024 04:47:33
%S A140774 0,1,1,1,1,2,1,2,1,2,1,3,1,2,2,2,1,3,1,2,2,2,1,4,1,2,2,2,1,4,1,3,2,2,
%T A140774 2,3,1,2,2,4,1,3,1,2,3,2,1,5,1,3,2,2,1,4,2,4,2,2,1,6,1,2,3,3,2,3,1,2,
%U A140774 2,4,1,5,1,2,3,2,2,3,1,5,2,2,1,5,2,2,2,3,1,5,2,2,2,2,2,6,1,3,2,3,1,3,1,3,4
%N A140774 Consider the products of all pairs of consecutive (when ordered by size) positive divisors of n. a(n) = the number of these products that divide n. a(n) also = the number of the products that are divisible by n.
%C A140774 Least number k whose value, a(k)=j beginning with j=0, is: 1, 2, 6, 12, 24, 48, 60, 168, 336, 240, 360, 672, 840, 720, 1512, 1680, 1440, 4320, 2520, 4200, 5040, 6720, 7560, 12480, 13440, 15840, ..., . - _Robert G. Wilson v_, May 30 2008
%H A140774 Antti Karttunen, <a href="/A140774/b140774.txt">Table of n, a(n) for n = 1..10000</a>
%e A140774 The divisors of 20 are 1,2,4,5,10,20. There are 2 pairs of consecutive divisors whose product divides 20: 1*2=2, 4*5 = 20. Likewise, there are 2 such products that are divisible by 20: 4*5=20, 10*20=200. So a(20) = 2.
%t A140774 f[n_] := Block[{d = Divisors@ n}, Count[n/((Most@d) (Rest@d)), _Integer]]; Array[f, 105] (* _Robert G. Wilson v_, May 30 2008 *)
%o A140774 (PARI)
%o A140774 \\ Two implementations, after the two different interpretations given by the author of the sequence:
%o A140774 A140774v1(n) = { my(ds = divisors(n),s=0); if(1==n,0,for(i=1,(#ds)-1,if(!(n%(ds[i]*ds[1+i])),s=s+1))); s; }
%o A140774 A140774v2(n) = { my(ds = divisors(n),s=0); if(1==n,0,for(i=1,(#ds)-1,if(!((ds[i]*ds[1+i])%n),s=s+1))); s; }
%o A140774 \\ _Antti Karttunen_, May 19 2017
%Y A140774 Cf. A140773.
%Y A140774 Differs from A099042 for the first time at n=32, where a(32) = 3, while A099042(32) = 2.
%K A140774 nonn
%O A140774 1,6
%A A140774 _Leroy Quet_, May 29 2008
%E A140774 More terms from _Robert G. Wilson v_, May 30 2008