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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195155 Number of divisors d of n such that d-1 also divides n or d-1 = 0. 2

%I

%S 1,2,1,2,1,3,1,2,1,2,1,4,1,2,1,2,1,3,1,3,1,2,1,4,1,2,1,2,1,4,1,2,1,2,

%T 1,4,1,2,1,3,1,4,1,2,1,2,1,4,1,2,1,2,1,3,1,3,1,2,1,6,1,2,1,2,1,3,1,2,

%U 1,2,1,5,1,2,1,2,1,3,1,3,1,2,1,5,1,2

%N Number of divisors d of n such that d-1 also divides n or d-1 = 0.

%C First differs from A055874 at a(20).

%H Harvey P. Dale, <a href="/A195155/b195155.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = A000005(n) - A195150(n).

%F a(n) = 1 + A129308(n).

%F a(2n-1) = 1; a(2n) = 1 + A007862(n).

%p with(numtheory):

%p a:= n-> add(`if`(d=1 or irem(n, d-1)=0, 1, 0), d=divisors(n)):

%p seq(a(n), n=1..200); # _Alois P. Heinz_, Oct 17 2011

%t d1[n_]:=Module[{d=Rest[Divisors[n]]},Count[d,_?(Divisible[n,#-1]&)]+1]; Array[d1, 90] (* _Harvey P. Dale_, Oct 31 2013 *)

%Y Cf. A000005, A007862, A049820, A055874, A129308, A137921, A195150, A195153.

%K nonn

%O 1,2

%A _Omar E. Pol_, Sep 19 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 15 18:59 EST 2019. Contains 329149 sequences. (Running on oeis4.)