This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A069585 #32 May 11 2024 10:11:59
%S A069585 0,1,2,0,1,2,3,0,0,1,2,3,4,5,6,0,1,2,3,4,5,6,7,8,0,1,0,1,2,3,4,0,1,2,
%T A069585 3,4,5,6,7,8,9,10,11,12,13,14,15,16,0,1,2,3,4,5,6,7,8,9,10,11,12,13,
%U A069585 14,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,0
%N A069585 a(n) = n - largest prime power <= n.
%C A069585 This sequence considers "prime powers" to be A025475 rather than A000961.
%C A069585 a(8)=a(9)=0. With Mihăilescu's proof of Catalan's conjecture (see A001597) there can be no further occurrence of consecutive zeros. - _Robert Munafo_, May 10 2024
%H A069585 Michael De Vlieger, <a href="/A069585/b069585.txt">Table of n, a(n) for n = 1..10000</a>
%F A069585 a(n) = n - A167185(n). - _Michel Marcus_, May 10 2024
%t A069585 nn = 10^4; s = {1}~Join~Select[Union@ Flatten@ Table[a^2*b^3, {b, Surd[nn, 3]}, {a, Sqrt[nn/b^3]}], PrimePowerQ]; Table[n - TakeWhile[s, # <= n &][[-1]], {n, nn}] (* _Michael De Vlieger_, May 11 2024 *)
%Y A069585 Cf. A031218, A069584.
%K A069585 easy,nonn
%O A069585 1,3
%A A069585 _Amarnath Murthy_, Mar 24 2002
%E A069585 Revised by _Robert Munafo_ and _Sean A. Irvine_, May 10 2024