A230653 -id:A230653 - cp's OEIS frontend

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

0, 0, 1, 1, 3, 2, 5, 4, 6, 6, 9, 6, 11, 10, 11, 11, 15, 12, 17, 14, 17, 18, 21, 16, 22, 22, 23, 22, 27, 22, 29, 26, 29, 30, 31, 27, 35, 34, 35, 32, 39, 34, 41, 38, 39, 42, 45, 38, 46, 44, 47, 46, 51, 46, 51, 48, 53, 54, 57, 48, 59, 58, 57, 57, 61, 58, 65

Offset: 1

Clark Kimberling

a(n) is the number of non-divisors of n in 1..n. - Jaroslav Krizek, Nov 14 2009
Also equal to the number of partitions p of n such that max(p)-min(p) = 1. The number of partitions of n with max(p)-min(p) <= 1 is n; there is one with k parts for each 1 <= k <= n. max(p)-min(p) = 0 iff k divides n, leaving n-d(n) with a difference of 1. It is easiest to see this by looking at fixed k with increasing n: for k=3, starting with n=3 the partitions are [1,1,1], [2,1,1], [2,2,1], [2,2,2], [3,2,2], etc. - Giovanni Resta, Feb 06 2006 and Franklin T. Adams-Watters, Jan 30 2011
Number of positive numbers in n-th row of array T given by A049816.
Number of proper non-divisors of n. - Omar E. Pol, May 25 2010
a(n+2) is the sum of the n-th antidiagonal of A225145. - Richard R. Forberg, May 02 2013
For n > 2, number of nonzero terms in n-th row of triangle A051778. - Reinhard Zumkeller, Dec 03 2014
Number of partitions of n of the form [j,j,...,j,i] (j > i). Example: a(7)=5 because we have [6,1], [5,2], [4,3], [3,3,1], and [2,2,2,1]. - Emeric Deutsch, Sep 22 2016

			a(7) = 5; the 5 non-divisors of 7 in 1..7 are 2, 3, 4, 5, and 6.
The 5 partitions of 7 with max(p) - min(p) = 1 are [4,3], [3,2,2], [2,2,2,1], [2,2,1,1,1] and [2,1,1,1,1,1]. - _Emeric Deutsch_, Mar 01 2006

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
G. E. Andrews, M. Beck, N. Robbins, Partitions with fixed differences between largest and smallest parts, arXiv preprint arXiv:1406.3374 [math.NT], 2014-2015.

Cf. A000005.
One less than A062968, two less than A059292.
Cf. A161664 (partial sums).
Cf. A060990 (number of solutions to a(x) = n).
Cf. A045765 (numbers not occurring in this sequence).
Cf. A236561 (same sequence sorted into ascending order), A236562 (with also duplicates removed), A236565, A262901 and A262903.
Cf. A262511 (numbers that occur only once).
Cf. A055927 (positions of repeated terms).
Cf. A245388 (positions of squares).
Cf. A155043 (number of steps needed to reach zero when iterating a(n)), A262680 (number of nonzero squares encountered).
Cf. A259934 (an infinite trunk of the tree defined by edge-relation a(child) = parent, conjectured to be unique).
Cf. tables and arrays A047916, A051731, A051778, A173540, A173541.
Cf. also arrays A225145, A262898, A263255 and tables A263265, A263267.
Other related sequences: A006218, A006590, A051953, A070824, A094181, A062249, A067391, A076627, A128508, A131187, A134156, A140826, A161886, A177235, A177236, A227874, A228453, A230653, A230654, A231167, A245197, A253473.

List([1..80],n->n-Tau(n)); # Muniru A Asiru, Sep 28 2018

a049820 n = n - a000005 n  -- Reinhard Zumkeller, Feb 06 2012

A049820 := n->n-numtheory[tau](n):
seq(A049820(n), n=1..100);

Table[n - DivisorSigma[0, n], {n, 100}] (* Wesley Ivan Hurt, Nov 19 2014 *)
Array[(# - DivisorSigma[0, #])&, 70] (* Vincenzo Librandi, Dec 29 2015 *)

PARI
```
a(n)=n-numdiv(n)
```

(define (A049820 n) (- n (A000005 n))) ;; Antti Karttunen, Nov 27 2015

a(n) = Sum_{k=1..n} ceiling(n/k)-floor(n/k). - Benoit Cloitre, May 11 2003
G.f.: Sum_{k>0} x^(2*k+1)/(1-x^k)/(1-x^(k+1)). - Emeric Deutsch, Mar 01 2006
a(n) = A006590(n) - A006218(n) = A161886(n) - A000005(n) - A006218(n) + 1 for n >= 1. - Jaroslav Krizek, Nov 14 2009
a(n) = Sum_{k=1..n} A000007(A051731(n,k)). - Reinhard Zumkeller, Mar 09 2010
a(n) = A076627(n) / A000005(n). - Reinhard Zumkeller, Feb 06 2012
For n >= 2, a(n) = A094181(n) / A051953(n). - Antti Karttunen, Nov 27 2015
a(n) = Sum_{k=1..n} ((n mod k) + (-n mod k))/k. - Wesley Ivan Hurt, Dec 28 2015
G.f.: Sum_{j>=2} (x^(j+1)*(1-x^(j-1))/(1-x^j))/(1-x). - Emeric Deutsch, Sep 22 2016
Dirichlet g.f.: zeta(s-1)- zeta(s)^2. - Ilya Gutkovskiy, Apr 12 2017
a(n) = Sum_{i=1..n-1} sign(i mod n-i). - Wesley Ivan Hurt, Sep 27 2018

Edited by Franklin T. Adams-Watters, Jan 30 2012

A230654 Numbers n such that tau(n+1) - tau(n) = 4, where tau(n) = the number of divisors of n (A000005).

Original entry on oeis.org

11, 17, 19, 31, 39, 43, 55, 65, 67, 69, 77, 87, 97, 129, 134, 163, 175, 183, 185, 194, 207, 211, 221, 237, 241, 247, 249, 254, 265, 283, 295, 309, 321, 327, 331, 337, 343, 351, 365, 398, 404, 417, 437, 454, 458, 459, 469, 471, 473, 482, 493, 494, 497, 505, 517

Offset: 1

Jaroslav Krizek, Nov 03 2013

nonn

Numbers n such that A051950(n+1) = 4. Numbers n such that A049820(n) - A049820(n+1) = 3. Sequence of starts of first run of n (n>=2) consecutive integers m_1, m_2, ..., m_n such that tau(m_k) - tau(m_k-1) = 4, for all k=n...2: 11, 458, 3013, ... (a(5) > 100000); example for n=4: tau(3013) = 4, tau(3014) = 8, tau(3015) = 12, tau(3016) = 16.

			19 is in sequence because tau(20) - tau(19) = 6 - 2 = 4.

Jaroslav Krizek, Table of n, a(n) for n = 1..4000

Cf. A055927 (numbers n such that tau(n+1) - tau(n) = 1), A230115 (numbers n such that tau(n+1) - tau(n) = 2), A230653 (numbers n such that tau(n+1) - tau(n) = 3), A000005.

Select[ Range[ 50000], DivisorSigma[0, # ] + 4 == DivisorSigma[0, # + 1] &]

A228453 Numbers k such that tau(k+1) - tau(k) = 5, where tau(k) = the number of divisors of k (A000005).

Original entry on oeis.org

35, 169, 289, 529, 961, 1369, 2809, 3135, 4489, 7921, 9409, 10609, 10815, 11881, 12769, 16129, 18495, 18769, 22201, 22801, 26569, 27889, 32041, 33855, 38809, 44521, 49729, 51529, 52441, 53823, 58081, 61503, 69169, 72361, 76729, 78961, 80089, 96721

Offset: 1

Jaroslav Krizek, Nov 03 2013

nonn

Numbers k such that A051950(k+1) = 5.
Numbers k such that A049820(k) - A049820(k+1) = 4.
Either k or k+1 is a square. - Amiram Eldar, Apr 17 2024

			35 is in sequence because tau(36) - tau(35) = 9 - 4 = 5.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000005, A049820, A051950.

Numbers k such that tau(k+1) - tau(k) = m: A055927 (m = 1), A230115 (m = 2), A230653 (m = 3), A230654 (m = 4), this sequence (m = 5).

Select[ Range[ 50000], DivisorSigma[0, # ] + 5 == DivisorSigma[0, # + 1] &]

lista(kmax) = {my(d); for(k = 2, kmax, d = numdiv(k^2); if(d == numdiv(k^2-1) + 5, print1(k^2-1, ", ")); if(d == numdiv(k^2+1) - 5, print1(k^2, ", ")));} \\ Amiram Eldar, Apr 17 2024

A227874 Numbers n such that tau(n+1) - tau(n) = -2, where tau(n) = the number of divisors of n (A000005).

Original entry on oeis.org

6, 10, 20, 22, 32, 45, 46, 50, 58, 68, 76, 82, 92, 106, 117, 124, 152, 166, 170, 174, 178, 212, 226, 236, 261, 262, 272, 325, 333, 338, 346, 358, 382, 405, 412, 424, 435, 436, 452, 464, 466, 474, 477, 478, 495, 502, 506, 512, 530, 555, 562, 567, 574, 578, 586

Offset: 1

Jaroslav Krizek, Nov 03 2013

nonn

Numbers n such that tau(n) - tau(n+1) = 2. Numbers n such that A051950(n+1) = -2. Numbers n such that A049820(n) - A049820(n+1) = -3.

Sequence of starts of first run of n (n>=2) consecutive integers m_1, m_2, ..., m_n such that tau(m_k) - tau(m_k-1) = -2, for all k=n...2: 6, 45, 1016, ... (a(5) > 100000); example for n=4: tau(1016) = 8, tau(1017) = 6, tau(1018) = 4, tau(1019) = 2.

			45 is in sequence because tau(46) - tau(45) = 4 - 6 = -2.

Jaroslav Krizek, Table of n, a(n) for n = 1..2000

Cf. A000005.
Cf. A055927 (numbers n such that tau(n+1) - tau(n) = 1).
Cf. A230115 (numbers n such that tau(n+1) - tau(n) = 2).
Cf. A230653 (numbers n such that tau(n+1) - tau(n) = 3).
Cf. A230654 (numbers n such that tau(n+1) - tau(n) = 4).
Cf. A228453 (numbers n such that tau(n+1) - tau(n) = 5).

Select[ Range[ 50000], DivisorSigma[0, # ] - 2 == DivisorSigma[0, # + 1] &]

A343018 a(n) is the smallest number m such that tau(m+1) = tau(m) + n.

Original entry on oeis.org

2, 1, 5, 49, 11, 35, 23, 399, 47, 1849, 59, 143, 119, 1599, 167, 575, 179, 1295, 239, 4355, 629, 2303, 359, 899, 959, 9215, 1007, 39999, 719, 20735, 839, 5183, 1799, 46655, 1259, 36863, 1679, 7055, 3023, 986049, 2879, 3599, 6479, 82943, 2519, 193599, 3359, 207935

Offset: 0

Jaroslav Krizek, Apr 02 2021

nonn

tau(m) = the number of divisors of m (A000005).
Sequences of numbers m such that tau(m+1) = tau(m) + n for 0 <= n <= 5:
n = 0: 2, 14, 21, 26, 33, 34, 38, 44, 57, 75, 85, 86, 93, ... (A005237).
n = 1: 1, 3, 9, 15, 25, 63, 121, 195, 255, 361, 483, 729, ... (A055927).
n = 2: 5, 7, 13, 27, 37, 51, 61, 62, 73, 74, 91, 115, 123, ... (A230115).
n = 3: 49, 99, 1023, 1681, 1935, 2499, 8649, 9603, 20449, ... (A230653).
n = 4: 11, 17, 19, 31, 39, 43, 55, 65, 67, 69, 77, 87, 97, ... (A230654).
n = 5: 35, 169, 289, 529, 961, 1369, 2809, 3135, 4489, ... (A228453).

			For n = 3; a(3) = 49 because 49 is the smallest number such that tau(50) = 6 = tau(49) + 3 = 3 + 3.

Robert Israel, Table of n, a(n) for n = 0..188

Cf. A000005 (tau), A080371, A080372, A086550, A340799, A343019, A343020.

Magma
```
Ax:=func; [Ax(n): n in [0..50]];
```

N:= 60: # for a(0)..a(N)
V:= Array(0..N): count:=0: t:= numtheory:-tau(1):
for m from 1 while count < N+1 do
  s:= numtheory:-tau(m+1); v:= s - t;
  if v >= 0 and v <= N and V[v] = 0 then count:= count+1; V[v]:= m; fi;
  t:= s;
od:
convert(V, list); # Robert Israel, Jan 03 2025

d = Differences @ Table[DivisorSigma[0, n], {n, 1, 10^6}]; a[n_] := If[(p = Position[d, n]) != {}, p[[1, 1]], 0]; s = {}; n = 0; While[(a1 = a[n]) > 0, AppendTo[s, a1]; n++]; s (* Amiram Eldar, Apr 03 2021 *)

a(n) = my(m=1); while (numdiv(m+1) != numdiv(m) + n, m++); m; \\ Michel Marcus, Apr 03 2021

from itertools import count, pairwise
from sympy import divisor_count
def A343018(n): return next(m+1 for m, t in enumerate(pairwise(map(divisor_count,count(1)))) if t[1] == t[0]+n) # Chai Wah Wu, Jul 25 2022

a(n) = A086550(n) - 1.

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Haskell

Maple

Mathematica

PARI

Scheme

Formula

Extensions

A230654 Numbers n such that tau(n+1) - tau(n) = 4, where tau(n) = the number of divisors of n (A000005).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A228453 Numbers k such that tau(k+1) - tau(k) = 5, where tau(k) = the number of divisors of k (A000005).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A227874 Numbers n such that tau(n+1) - tau(n) = -2, where tau(n) = the number of divisors of n (A000005).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A343018 a(n) is the smallest number m such that tau(m+1) = tau(m) + n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Python

Formula