[seqfan] a(n) is tau[a(n)+a(n+1)]

[Eric Angelini]

Hello SeqFans,

If we decide that a(n) is tau[a(n)+a(n+1)], then
a monotonically increasing sequence S of such terms
could start like this:

S = 2,3,6,12,48,2472,...

Are more terms of S computable?

If we drop the "monotonically increasing" constraint
but add "all terms of T must be different -- always
take the smallest available integer not leading to
a contradiction", would T be different of S? [of course
0 and 1 are not allowed in T]

Best,
É.