login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074802 Number of numbers k <= n such that tau(k) = tau(k+1) where tau(x) = A000005(x) is the number of divisors of x. 0

%I #13 Jun 25 2022 00:48:32

%S 0,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,3,3,3,3,3,4,4,4,4,4,4,4,5,6,

%T 6,6,6,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,9,9,

%U 9,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10,11,12,12,12,12,12,12,12,13,14

%N Number of numbers k <= n such that tau(k) = tau(k+1) where tau(x) = A000005(x) is the number of divisors of x.

%F Is a(n) asymptotic to c*n with c=0.1......?

%t Accumulate[If[#[[1]]==#[[2]],1,0]&/@Partition[DivisorSigma[ 0,Range[ 100]],2,1]] (* _Harvey P. Dale_, Jan 27 2021 *)

%o (PARI) a(n)=sum(i=1,n,if(numdiv(i)-numdiv(i+1),0,1))

%Y Cf. A000005 (tau), A005237.

%Y Partial sums of A130638.

%K easy,nonn

%O 1,14

%A _Benoit Cloitre_, Sep 08 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)