login

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

a(n) = number of integers 2 <= i < A247665(n) that are not yet terms of A247665.
2

%I #7 May 09 2021 02:30:56

%S 0,0,0,0,1,2,1,2,3,6,7,10,9,14,13,14,19,22,23,26,31,36,37,42,45,46,45,

%T 44,49,52,51,50,55,62,65,66,69,70,73,80,85,88,93,94,103,104,109,114,

%U 117,118,121,126,127,136,135,136,135,138,139,150,161,164,163,164

%N a(n) = number of integers 2 <= i < A247665(n) that are not yet terms of A247665.

%C An alternative version to A249049. The latter is the main entry.

%Y Cf. A247665. Equals A249049(n)-1.

%K nonn

%O 1,6

%A _N. J. A. Sloane_, Oct 30 2014