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 A064722 #31 Aug 18 2024 16:43:10
%S A064722 0,0,0,1,0,1,0,1,2,3,0,1,0,1,2,3,0,1,0,1,2,3,0,1,2,3,4,5,0,1,0,1,2,3,
%T A064722 4,5,0,1,2,3,0,1,0,1,2,3,0,1,2,3,4,5,0,1,2,3,4,5,0,1,0,1,2,3,4,5,0,1,
%U A064722 2,3,0,1,0,1,2,3,4,5,0,1,2,3,0,1,2,3,4,5,0,1,2,3,4,5,6,7,0,1,2,3,0,1,0,1,2,3
%N A064722 a(1) = 0; for n >= 2, a(n) = n - (largest prime <= n).
%H A064722 Harry J. Smith, <a href="/A064722/b064722.txt">Table of n, a(n) for n=1..1000</a>
%F A064722 a(n) = n - A007917(n).
%F A064722 a(n) = 0 iff n is 1 or a prime.
%F A064722 Computable also as a "commutator": pi(prime(m)) - prime(pi(m)) = A000720(A000040(m))-A000040(A000720(m)). Labels position of composites between 2 consecutive primes. - _Labos Elemer_, Oct 19 2001
%F A064722 a(n) = a(n-1)*0^A010051(n) + 1 - A010051(n), a(1) = 0. - _Reinhard Zumkeller_, Mar 23 2006
%F A064722 a(n) = n mod A007917(n). - _Michel Marcus_, Aug 22 2014
%F A064722 a(n) = A049711(n+1) - 1 for n >= 2. - _Pontus von Brömssen_, Jul 31 2022
%e A064722 a(26) = 26 - 23 = 3, a(37) = 37 - 37 = 0.
%p A064722 0, seq(n - prevprime(n+1), n=2..100); # _Robert Israel_, Aug 25 2014
%t A064722 Join[{0},Table[n-NextPrime[n+1,-1],{n,2,110}]] (* _Harvey P. Dale_, Aug 23 2011 *)
%o A064722 (PARI) { for (n = 1, 1000, if (n>1, a=n - precprime(n), a=0); write("b064722.txt", n, " ", a) ) } \\ _Harry J. Smith_, Sep 23 2009
%Y A064722 Cf. A000040, A000720, A007917, A007920, A010051, A049711.
%K A064722 nonn,easy
%O A064722 1,9
%A A064722 _Reinhard Zumkeller_, Oct 13 2001