The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A328050 a(n) = abs(A328049(n)). 3
 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 (list; graph; refs; listen; history; text; internal format)
 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 24 11:08 EST 2024. Contains 370303 sequences. (Running on oeis4.)