login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A362909
a(n) is the smallest number k such that A362881(k) = n.
2
1, 3, 6, 10, 22, 31, 34, 37, 40, 121, 1035, 1078, 1121, 7607, 9453, 13667, 13729, 50040, 50123, 50206, 615964, 616448, 616932, 617416, 2828280, 2851232, 2874184, 2897136, 5350614, 5583250, 5594326, 17310256, 17312210, 17994974, 18008820, 19051432, 19069162
OFFSET
1,2
COMMENTS
All positive integers will appear in A362881. Rémy Sigrist showed that as a consequence of Van der Waerden's theorem, A362881 is unbounded.
The present sequence is monotonically increasing since a progression of length n begins with a progression of length n-1 so a(n-1) < a(n).
LINKS
Kevin Ryde, C Code
PROG
(MATLAB) See Links section.
(C) /* See links */
CROSSREFS
Cf. A362881.
Sequence in context: A220827 A063015 A372851 * A282515 A284202 A275189
KEYWORD
nonn,changed
AUTHOR
Samuel Harkness, May 14 2023
EXTENSIONS
a(25)-a(31) from Yang Haoran, May 17 2023
a(32)-a(37) from Kevin Ryde, May 22 2023
STATUS
approved