

A259934


Infinite sequence starting with a(0)=0 such that A049820(a(k)) = a(k1) for all k>=1, where A049820(n) = n  (number of divisors of n).


71



0, 2, 6, 12, 18, 22, 30, 34, 42, 46, 54, 58, 62, 70, 78, 90, 94, 102, 106, 114, 118, 121, 125, 129, 144, 152, 162, 166, 174, 182, 190, 194, 210, 214, 222, 230, 236, 242, 250, 254, 270, 274, 282, 294, 298, 302, 310, 314, 330, 342, 346, 354, 358, 366, 374, 390, 394, 402, 410, 418, 426, 434, 442, 446, 462, 466, 474, 486, 494, 510, 522, 530, 546, 558, 562, 566, 574, 582, 590
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

Equivalently, satisfies the property: A000005(a(n)) = a(n)a(n1). The first differences a(n)a(n1) are given in A259935.
Falcao (2015) proved that such an infinite sequence exists. Numerical evidence suggests that it may also be unique  is it? All terms below 10^10 are defined uniquely.
If the current definition does not uniquely define the sequence, the "lexicographically earliest" condition may be added to make the sequence welldefined.
From Vladimir Shevelev, Jul 21 2015: (Start)
If a(k), a(k+1), a(k+2) is an arithmetic progression, then a(k+1) is in A175304.
Indeed, by the definition of this sequence, a(n)a(n1) = d(a(n)), for all n>=1, where d(n) = A000005(n). Hence, have a(k+1)  a(k) = a(k+2)  a(k+1) = d(a(k+1)) = d(a(k+2)). So a(k+1) + d(a(k+2)) = a(k+2) and a(k+1) + d(a(k+1)) = a(k+2).
Therefore, d(a(k+1) + d(a(k+1))) = d(a(k+2))= d(a(k+1)), i.e., a(k+1) is in A175304. Thus, if there are infinitely many pairs of the same consecutive terms of A259935, then A175304 is infinite (see there my conjecture). (End)
From Antti Karttunen, Nov 27 2015: (Start)
If multiple apparently infinite branches would occur at some point of computing, then even if the "lexicographically earliest" condition were then added to the definition, it would not help us much (when computing the sequence), as we would still not know which of the said branches were truly infinite. [See also Max Alekseyev's latter Jul 9 2015 posting on SeqFanlist, where he notes the same thing.] Note that many of the derived sequences tacitly assume that the uniquenessconjecture is true. See also comments at A262693 and A262896.
One sufficient (but not a necessary) condition for the uniqueness of this sequence is that the sequence A262509 has infinite number of terms. Please see further comments there.
The graph of sequence exhibits two markedly different slopes, depending on whether it is on the "fast lane" of A049820 (even numbers) or the "slow lane" [odd numbers, for example when traversing the 1356 odd terms from 123871 to 113569 at range a(9859) .. a(8504)]. See A263086/A263085 for the "average cumulative speed difference" between the lanes. In general, slow and fast lane stay separate, except when they terminate into one of the squares (A262514) that work as "exchange ramps", forcing the parity (and thus the speed) to change. In average, the odd squares are slightly better than the even squares in attracting lanes going towards smaller numbers (compare A263253 to A263252). The cumulative effect of this bias is that the odd terms are much rarer in this sequence than the even terms (compare A263278 to A262516).
(End)


LINKS

Robert Israel, Table of n, a(n) for n = 0..64800
M. Alekseyev et al., Apparently unique infinite sequences related to the sum of divisors, Discussion in SeqFan mailing list, 2015.
Michael De Vlieger, Poster illustrating A259934 and A263267
Falcao et al., Sequence and divisors, 2015. (in Russian)


FORMULA

From Antti Karttunen, Nov 27 2015: (Start)
Other identities and observations. For all n >= 0:
a(n) = A262679(A262896(n)).
A155043(a(n)) = A262694(a(n)) = A262904(a(n)) = n.
A261089(n) <= a(n) <= A262503(n). [A261103 and A262506 give the distances of a(n) to these bounds.]
(End)


MAPLE

N:= 10^4: # to get "guaranteed unique" terms <= N
S:= Vector(N, datatype=integer[1]):
for n from N+1 to 2*N do
k:= n  numtheory:tau(n);
if k <= N then S[k]:= S[k]+1; B[k]:= n; fi;
od:
for n from N to 3 by 1 do
if S[n] >= 1 then
k:= n  numtheory:tau(n);
S[k]:= S[k]+1; B[k]:= n;
fi
od:
A[0]:= 0: A[1]:= 2:
for n from 2 do
b:= B[A[n1]];
if b > N or S[b] > 1 then break fi;
A[n]:= b;
od:
seq(A[i], i=0..n1); # Robert Israel, Jul 09 2015


MATHEMATICA

NN = 10^4; (* to get "guaranteed unique" terms <= NN *)
Clear[A, B, S]; S[_]=0; For[n = NN+1, n <= 2*NN, n++, k = nDivisorSigma[0, n]; If[k <= NN, S[k] = S[k]+1; B[k]=n]]; For[n=NN, n >= 3, n, If[S[n] >= 1 , k = nDivisorSigma[0, n]; S[k] = S[k]+1; B[k]=n]]; A[0]=0; A[1]=2; For[n=2, True, n++, b = B[A[n1]]; If[b>NN  S[b]>1, Break[]]; A[n]=b]; Table[A[i], {i, 0, n1}] (* JeanFrançois Alcover, Jul 22 2015, after Robert Israel *)


CROSSREFS

Cf. A000005, A049820, A060990, A259935 (first differences).
Topmost row of A263255. Cf. also irregular tables A263267 & A263265 and array A262898.
Cf. A262693 (characteristic function).
Cf. A155043, A262694, A262904 (left inverses).
Cf. A262514 (squares present), A263276 (their positions), A263277.
Cf. A262517 (odd terms).
Cf. A262509, A262510, A262897 (other subsequences).
Cf. also A175304, A260257, A262680.
Cf. A261089, A261103, A262503, A262506, A262516, A263279, A263280, A263085, A263086, A263253, A263257, A263278.
Cf. also A262679, A262896 (see the C++ program there).
No common terms with A045765 or A262903.
Positions of zeros in A262522, A262695, A262696, A262697, A263254.
Various metrics concerning finite sidetrees: A262888, A262889, A262890.
Cf. also A262891, A262892 and A262895 (cf. its graph).
Cf. A260084, A260124 (variants).
Cf. also A179016 (a similar "beanstalk trunk sequence" but with more tractable and regular behavior).
Sequence in context: A108727 A138630 A026229 * A263269 A262503 A263082
Adjacent sequences: A259931 A259932 A259933 * A259935 A259936 A259937


KEYWORD

nonn,nice


AUTHOR

Max Alekseyev, Jul 09 2015


STATUS

approved



