The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A188540 Numbers k such that d(k+2) = 2*d(k) where d(k) is the number of divisors of k (A000005). 3

%I

%S 1,13,19,22,31,37,38,53,67,83,86,89,109,113,124,127,131,133,134,139,

%T 148,157,169,181,187,199,211,233,251,253,257,263,292,293,295,307,310,

%U 317,326,328,337,338,343,353,355,361,376,379,389,401,406,409,412,422,427,438,443,449,453

%N Numbers k such that d(k+2) = 2*d(k) where d(k) is the number of divisors of k (A000005).

%H Amiram Eldar, <a href="/A188540/b188540.txt">Table of n, a(n) for n = 1..10000</a>

%e 1 is a term since d(1+2) = d(3) = 2 = 2*d(1).

%t Select[Range[500], DivisorSigma[0, # + 2] == 2 * DivisorSigma[0, #] &] (* _Amiram Eldar_, Jan 17 2021 *)

%o (PARI) isok(k) = numdiv(k+2) == 2*numdiv(k); \\ _Michel Marcus_, Jan 17 2021

%Y Cf. A000005, A063446, A160921.

%K nonn,easy

%O 1,2

%A _Juri-Stepan Gerasimov_, Apr 03 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.

Last modified June 21 03:51 EDT 2021. Contains 345354 sequences. (Running on oeis4.)