A328050 a(n) = abs(A328049(n)).

1, 2, 1, 3, 1, 3, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 3, 2, 3, 2, 5, 2, 3, 2, 3, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 1, 1, 3, 2, 3

Offset

1,2

Comments

Do the values occurring in this sequence have an upper bound?

Links

Table of n, a(n) for n=1..87.

Prog

(PARI) my(v=[1], terms=40); while(1, if(#v > terms, break); for(k=1, oo, if(bigomega(k)!=bigomega(v[#v]) && !setsearch(vecsort(v), k), print1(abs(k-v[#v]), ", "); v=concat(v, k); break)))

Crossrefs

Cf. A328047, A328048, A328049.

Sequence in context: A328570 A078079 A328049 * A335620 A176982 A079728

Adjacent sequences: A328047 A328048 A328049 * A328051 A328052 A328053

Keyword

nonn,easy

Author

Felix Fröhlich, Oct 03 2019

Status

approved