login
a(n) = smallest number missing from A375564 after A375564(n) has been found.
1

%I #7 Sep 26 2024 20:24:39

%S 2,3,4,5,5,5,5,7,9,11,11,11,11,11,11,11,11,13,17,19,21,23,23,23,23,23,

%T 23,23,23,23,23,23,23,23,23,23,23,23,23,29,31,37,41,43,45,47,47,47,47,

%U 47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,53,59,61,67,71,73,79,83,85,89

%N a(n) = smallest number missing from A375564 after A375564(n) has been found.

%H N. J. A. Sloane, <a href="/A376194/b376194.txt">Table of n, a(n) for n = 1..5000</a>

%e A375564 begins 1, 2, 3, 4, 6, 8, 10, 5, 7, 9, 12, ... so the successive smallest missing numbers are 2, 3, 4, 5, 5, 5, 7, 9, 11, 11, 11, ...

%Y Cf. A375564.

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Sep 26 2024