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”).
%I #11 May 31 2024 09:22:09
%S 0,0,1,1,1,1,2,1,1,1,1,1,2,1,1,1,1,1,2,1,2,3,1,1,2,1,1,1,1,1,2,1,1,1,
%T 1,1,2,1,1,1,2,1,2,1,1,1,1,1,2,1,1,1,1,1,2,1,1,1,1,1,2,1,1,2,1,1,2,1,
%U 1,1,1,1,2,1,1,1,1,1,2,1,2,1,1,1,2,1,1
%N Difference between 2^n and the greatest squarefree number <= 2^n.
%F a(n) = 2^n-A372889(n). - _R. J. Mathar_, May 31 2024
%e The greatest squarefree number <= 2^21 is 2097149, and 2^21 = 2097152, so a(21) = 3.
%t Table[2^n-NestWhile[#-1&,2^n,!SquareFreeQ[#]&],{n,0,100}]
%Y For prime instead of squarefree we have A013603, opposite A092131.
%Y For primes instead of powers of 2: A240474, A240473, A112926, A112925.
%Y Difference between 2^n and A372889.
%Y The opposite is A373125, delta of A372683.
%Y A005117 lists squarefree numbers, first differences A076259.
%Y A053797 gives lengths of gaps between squarefree numbers.
%Y A061398 counts squarefree numbers between primes (exclusive).
%Y A070939 or (preferably) A029837 gives length of binary expansion.
%Y A077643 counts squarefree terms between powers of 2, run-lengths of A372475.
%Y A143658 counts squarefree numbers up to 2^n.
%Y Cf. A372473 (firsts of A372472), A372541 (firsts of A372433).
%Y For primes between powers of 2:
%Y - sum A293697 (except initial terms)
%Y - length A036378
%Y - min A104080 or A014210, indices A372684 (firsts of A035100)
%Y - max A014234
%Y Cf. A010036, A029931, A046933, A049093-A049096, A077641, A372540, A373197.
%K nonn
%O 0,7
%A _Gus Wiseman_, May 29 2024