login
A356855
a(n) is the least number m such that u defined by u(i) = bigomega(m + 2i) satisfies u(i) = u(0) for 0 <= i < n and u(n) != u(0), or -1 if no such number exists.
1
1, 4, 3, 215, 213, 1383, 3091, 8129, 151403, 151401, 2560187, 33396293, 33396291, 56735777, 1156217487, 2514196079
OFFSET
1,2
EXAMPLE
Let u be defined by u(i) = bigomega(3 + 2i). u(i) = 1 for 0 <= i < 3 and u(3) = 2 != 1, and 3 is the smallest such number, hence a(3) = 3.
Let u be defined by u(i) = bigomega(4 + 2i). u(i) = 2 for 0 <= i < 2 and u(3) = 3 != 2 , and 4 is the smallest such number, hence a(2) = 4.
Let u be defined by u(i) = bigomega(151403 + 2i). u(i) = 3 for 0 <= i < 9 and u(9) = 2 != 3, and 151403 is the smallest such number, hence a(9) = 151403.
PROG
(PARI) u(m, i)=bigomega(m+2*i)
card(m)=my(k=u(m, 0), c=0); while(u(m, c)==k, c++); c
a(n)=my(c=0); for(m=1, +oo, c=card(m); if(c==n, return(m)))
CROSSREFS
Cf. A073093 and A091304 (the 2 bisections of A001222).
Sequence in context: A002298 A195565 A368301 * A335913 A340667 A344407
KEYWORD
nonn,more
AUTHOR
Jean-Marc Rebert, Sep 04 2022
STATUS
approved