A286529 -id:A286529 - cp's OEIS frontend

A175304 A positive integer n is included if d(n+d(n)) = d(n), where d(n) is the number of divisors of n.

3, 5, 6, 10, 11, 12, 17, 22, 29, 34, 35, 41, 44, 51, 58, 59, 60, 65, 70, 71, 72, 82, 84, 87, 91, 92, 96, 101, 102, 107, 111, 115, 118, 119, 125, 128, 129, 130, 137, 141, 142, 147, 149, 155, 174, 179, 182, 183, 191, 197, 201, 202, 205, 209, 213, 214, 215, 217, 222

Offset: 1

Leroy Quet, Mar 24 2010

nonn

The sequence contains the smaller member of every pair of twin primes (A001359) and all squarefree semiprimes m such that m+4 is also a squarefree semiprime (A255746). Can one prove that this is an infinite sequence? - Vladimir Shevelev, Jul 11 2015
The sequence does not contain perfect squares. Indeed, let a(m)=k^2. Then d(k^2+d(k^2)) = d(k^2). Note that d(k^2) is odd. On the other hand, it is known (A046522) that d(k^2)<2*k. Hence, (k+1)^2 - k^2 > d(k^2). Thus k^2Vladimir Shevelev, Feb 10 2017
If p is prime and t+1 is odd prime, then p^t is not in the sequence. Indeed, if d(p^t+t+1)=t+1, then p^t+t+1=q^t, where q is prime > p (if p^t+t+1= say q^l*r^m, then (l+1)*(m+1)=t+1 which is impossible by the condition). But q>=p+2 and p^t+t+1>=p^t+2*t*p^(t-1) or t+1>=2*t*p^(t-1) which trivially has only solution t=1; however, by the condition t>=2. - Vladimir Shevelev, Feb 18 2017
If an odd integer k is in this sequence, so is 2k. - Charlie Neder, Jan 14 2019

			10 is in the sequence because d(10)=4 and d(10+d(10))=d(14)=4. - _Emeric Deutsch_, Apr 08 2010

Alois P. Heinz, Table of n, a(n) for n = 1..10000

Cf. A000005, A062249, A001359, A255746, A259934, A282175, A282231, A286529.

Positions of zeros in A286530.

with(numtheory): a := proc (n) if tau(n+tau(n)) = tau(n) then n else end if end proc: seq(a(n), n = 1 .. 230); # Emeric Deutsch, Apr 08 2010

Select[Range@ 224, Function[n, DivisorSigma[0, n + #] == # &@ DivisorSigma[0, n]]](* Michael De Vlieger, Sep 27 2015 *)
Position[#, 0][[All, 1]] &@ Table[DivisorSigma[0, n + DivisorSigma[0, n]] - DivisorSigma[0, n], {n, 222}] (* Michael De Vlieger, May 21 2017 *)

is(n)=numdiv(n+n=numdiv(n))==n \\ M. F. Hasler, Sep 27 2015

More terms from Emeric Deutsch, Apr 08 2010

A286530 a(n) = d(n+d(n)) - d(n), where d(n) is the number of divisors of n (A000005).

Original entry on oeis.org

1, 1, 0, -1, 0, 0, 1, 2, 3, 0, 0, 0, 2, 2, -2, -1, 0, 2, 2, -2, -1, 0, 1, -2, 3, 4, -2, -2, 0, -4, 2, -2, -2, 0, 0, -3, 2, 4, -2, 2, 0, -2, 4, 0, -2, 2, 1, -6, 3, 2, 0, -2, 2, -4, -2, -1, -2, 0, 0, 0, 4, 4, -2, -5, 0, -4, 2, -2, -2, 0, 0, 0, 4, 4, -1, -2, 1, -4, 3, 2, -1, 0, 2, 0, -2, 8, 0, 4, 2, -4, 0, 0, -2, 2, 2, 0, 4, 2, 2, -7, 0, 0, 6, 2, -6, 4, 0, 4, 2

Offset: 1

Antti Karttunen, May 21 2017

sign

Antti Karttunen, Table of n, a(n) for n = 1..10000

Cf. A000005, A286529, A286480.

Cf. A175304 (the positions of zeros).

Table[DivisorSigma[0, n + DivisorSigma[0, n]] - DivisorSigma[0, n], {n, 109}] (* Michael De Vlieger, May 21 2017 *)

A286530(n) = (numdiv(n+numdiv(n)) - numdiv(n));

from sympy import divisor_count as d
def a(n): return d(n + d(n)) - d(n) # Indranil Ghosh, May 21 2017

(define (A286530 n) (- (A286529 n) (A000005 n)))

a(n) = A286529(n) - A000005(n) = A000005(n+A000005(n)) - A000005(n).

A286479 a(n) = A046523(n+A000005(n)).

Original entry on oeis.org

2, 4, 2, 2, 2, 6, 4, 12, 12, 6, 2, 12, 6, 12, 2, 6, 2, 24, 6, 6, 4, 6, 4, 32, 12, 30, 2, 6, 2, 6, 6, 6, 2, 6, 6, 12, 6, 30, 2, 48, 2, 12, 12, 12, 6, 12, 4, 6, 12, 24, 6, 6, 6, 6, 2, 64, 2, 6, 2, 72, 12, 30, 6, 2, 6, 6, 6, 6, 2, 30, 2, 60, 12, 30, 16, 6, 16, 6, 16, 60, 6, 6, 6, 96, 2, 60, 6, 96, 6, 30, 6, 12, 2, 12, 12, 72, 12, 24, 30, 2, 2, 30, 30, 48, 2, 30

Offset: 1

Antti Karttunen, May 21 2017

nonn

Antti Karttunen, Table of n, a(n) for n = 1..10000

Cf. A000005, A046523, A062249, A286480, A286529.

Table[Times @@ MapIndexed[Prime[First[#2]]^#1 &, Sort[FactorInteger[n + DivisorSigma[0, n]][[All, -1]], Greater]], {n, 106}] (* Michael De Vlieger, May 21 2017 *)

A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ This function from Charles R Greathouse IV, Aug 17 2011
A286479(n) = A046523(n+numdiv(n));
for(n=1,10000,write("b286479.txt", n, " ", A286479(n)));

from sympy import factorint, divisor_count
def P(n):
    f = factorint(n)
    return sorted([f[i] for i in f])
def a046523(n):
    x=1
    while True:
        if P(n) == P(x): return x
        else: x+=1
def a(n): return a046523(n + divisor_count(n)) # Indranil Ghosh, May 21 2017

(define (A286479 n) (A046523 (+ n (A000005 n))))

a(n) = A046523(A062249(n)) = A046523(n+A000005(n)).

A348337 For n >= 1; x = n, then iterate x --> x + d(x) until d(x + d(x)) >= d(x). a(n) gives the number of iteration steps where d(i) is the number of divisors of i, A000005(i).

Original entry on oeis.org

3, 2, 7, 1, 6, 5, 5, 4, 4, 4, 3, 3, 2, 3, 1, 1, 3, 2, 2, 1, 1, 3, 3, 1, 2, 2, 1, 1, 3, 1, 2, 1, 1, 3, 2, 1, 2, 2, 1, 2, 3, 1, 2, 3, 1, 3, 3, 1, 2, 2, 2, 1, 2, 1, 1, 1, 1, 3, 3, 6, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 3, 5, 2, 2, 1, 1, 2, 1, 2, 2, 1, 3, 2, 4, 1, 2, 5, 4, 5, 1, 4, 4, 1, 4, 3, 3, 3, 3, 2, 1

Offset: 1

Ctibor O. Zizka, Oct 13 2021

nonn

a(n) = 1 for n from A260577.

			n = 1; x(1) = 1 + d(1) = 2, d(1 + d(1)) >= d(1) thus x(2) = 2 + d(2) = 4, d(2 + d(2)) >= d(2) thus x(3) = 4 + d(4) = 7, d(4 + d(4)) < d(4), stop. a(1) = 3.

Cf. A000005, A062249, A175304, A259934, A260577, A286529.

d[n_] := DivisorSigma[0, n]; x[n_] := n + d[n]; a[n_] := Length@ NestWhileList[x, n, d[#] <= d[x[#]] &]; Array[a, 100] (* Amiram Eldar, Oct 15 2021 *)

cp's OEIS Frontend

A175304 A positive integer n is included if d(n+d(n)) = d(n), where d(n) is the number of divisors of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Extensions

A286530 a(n) = d(n+d(n)) - d(n), where d(n) is the number of divisors of n (A000005).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Scheme

Formula

A286479 a(n) = A046523(n+A000005(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Scheme

Formula

A348337 For n >= 1; x = n, then iterate x --> x + d(x) until d(x + d(x)) >= d(x). a(n) gives the number of iteration steps where d(i) is the number of divisors of i, A000005(i).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica