A347338 a(n) is the smallest number k such that tau(k) = tau(k+n), and there is no number m, k < m < k+n such that tau(m) = tau(k).

2, 3, 35, 7, 4, 12, 39, 20, 146, 30, 52, 32, 175, 88, 693, 9, 99, 108, 188, 847, 1014, 392, 124, 25, 315, 234, 195, 416, 196, 477, 225, 48, 2262, 1327, 1330, 252, 368, 160, 1636, 640, 5067, 168, 441, 884, 1183, 1064, 1377, 120, 1328, 112, 4908, 3872, 891, 396, 512

Offset

1,1

Comments

The prohibition in the definition distinguishes this sequence from A065559. This sequence identifies the first occurrence of a gap between numbers with the same tau, where no intervening number has that tau. Each tau t > 1 has a corresponding sequence of gaps (e.g., for t = 2, A001223, for t = 3, A069482), and a(n) is the smallest index of terms in A000005 corresponding to the first occurrence of a gap of length n in all of these (same tau) gap sequences.

A number appearing in this sequence cannot appear again, and many numbers do not appear at all (1 is not in because it is the only number with 1 divisor; 5 6 and 8 are not in because 3 is already a term; 10 is not in because 7 is a term, etc.

Links

David A. Corneth, Table of n, a(n) for n = 1..10000

Example

a(1) = 2 because 2 is the smallest k such that tau(k) = tau(k+1); a(2) = 3 because it is the smallest k with tau(k) = tau(k+2) with no intervening same tau number; a(3) = 35 because d(35) = 4, d(36) = 9, d(37) = 2, d(38) = 4 = d(35) and this is the least case of a gap of 3. (Here d means tau, namely, A000005.)

Mathematica

Block[{a = {}, k, d = DivisorSigma[0, Range[2^14]]}, Do[k = 1; While[Or[#[[1]] != #[[-1]], Count[#, #[[1]]] > 2] &@ d[[k ;; k + n]], k++]; AppendTo[a, k], {n, 55}]; a] (* Michael De Vlieger, Aug 27 2021 *)

Prog

(PARI) a(n) = {my(i); for(i = 1, oo, if(iscan(i, n), return(i) ) ) }
iscan(k, n) = { my(c); c = numdiv(k); if(numdiv(k + n) != c, return(0) ); for(i = 1, n-1, if(numdiv(k + i) == c, return(0) ) ); 1 } \\ David A. Corneth, Aug 27 2021
(Python)
from sympy import divisor_count
from functools import lru_cache
@lru_cache(maxsize=None)
def tau(n): return divisor_count(n)
def a(n):
    k = 2
    while True:
        while tau(k) != tau(k+n): k += 1
        if not any(tau(m) == tau(k) for m in range(k+1, k+n)): return k
        k += 1
print([a(n) for n in range(1, 56)]) # Michael S. Branicky, Aug 27 2021

Crossrefs

Cf: A000005, A001223, A005237, A069482, A276963, A005179, A065559.

Sequence in context: A228114 A025136 A195030 * A092981 A042167 A126910

Adjacent sequences: A347335 A347336 A347337 * A347339 A347340 A347341

Keyword

nonn

Author

David James Sycamore, Aug 27 2021

Status

approved