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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309197 List of numbers k such that A111273(k) reaches the smallest missing number. 3

%I #10 Jul 22 2021 02:12:34

%S 1,3,7,8,15,19,23,31,32,39,48,63,71,83,95,103,111,127,143,147,151,159,

%T 167,175,195,199,207,211,215,223,224,255,271,279,287,319,327,343,351,

%U 359,367,371,383,391,399,415,431,435,447,463,464,511,543,559,579,583,595,607,639,655,663,687,703

%N List of numbers k such that A111273(k) reaches the smallest missing number.

%H Rémy Sigrist, <a href="/A309197/b309197.txt">Table of n, a(n) for n = 1..10000</a>

%H Rémy Sigrist, <a href="/A309197/a309197.gp.txt">PARI program for A309197</a>

%e 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.

%o (PARI) See Links section.

%Y Cf. A111273, A309195, A309196.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Jul 24 2019

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)