login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309197 List of numbers n such that A111273(n) reaches the smallest missing number. 3
1, 3, 7, 8, 15, 19, 23, 31, 32, 39, 48, 63, 71, 83, 95, 103, 111, 127, 143, 147, 151, 159, 167, 175, 195, 199, 207, 211, 215, 223, 224, 255, 271, 279, 287, 319, 327, 343, 351, 359, 367, 371, 383, 391, 399, 415, 431, 435, 447, 463, 464, 511, 543, 559, 579, 583, 595, 607, 639, 655, 663, 687, 703 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, PARI program for A309197

EXAMPLE

After we reach A111273(8) = 6, the smallest missing number in A111273 is 8 (see A309195). We do not see 8 in A111273 until we reach A111273(15) = 8, so 15 is a term.

PROG

(PARI) See Links section.

CROSSREFS

Cf. A111273, A309195, A309196.

Sequence in context: A131559 A051211 A105173 * A076683 A045542 A249435

Adjacent sequences:  A309194 A309195 A309196 * A309198 A309199 A309200

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jul 24 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 7 13:17 EDT 2020. Contains 333305 sequences. (Running on oeis4.)