A253443 - OEIS

A253443

Smallest missing number within the first n terms inA109890.

4, 4, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 34, 37, 37, 37, 37, 37

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

OFFSET

4,1

COMMENTS

A253584(n) occurs exactlyA253444(n) times.

LINKS

Reinhard Zumkeller,Table of n, a(n) for n = 4..10000

PROG

(Haskell)

import Data.List (insert)

a253443 n = a253443_list!! (n-4)

a253443_list = f (4, []) 6 where