A345672 - OEIS

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

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”).

Other ways to Give

A345672

a(n) is the least m such that the decimal expansion of n appears in the concatenation of m, ..., m+k for some k >= 0 and Sum_{i = m..m+k-1} A055642(i) < A055642(n) <= Sum_{i = m..m+k} A055642(i).

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 1, 13, 14, 15, 16, 17, 18, 19, 20, 12, 22, 2, 24, 25, 26, 27, 28, 29, 30, 13, 23, 33, 3, 35, 36, 37, 38, 39, 40, 14, 24, 34, 44, 4, 46, 47, 48, 49, 50, 15, 25, 35, 45, 55, 5, 57, 58, 59, 60, 16, 26, 36, 46, 56, 66, 6, 68

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

This sequence is similar to A055642; here we consider decimal expansions, there binary expansions.

LINKS

Table of n, a(n) for n=0..68.

Rémy Sigrist, PARI program for A345672

FORMULA

a(n) <= n.

a(n) = 1 iff n belongs to A252043.

EXAMPLE