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 A347342 #15 Sep 14 2021 04:43:05 %S A347342 0,0,0,0,1,1,1,1,1,1,1,1,2,1,2,2,2,1,1,2,1,1,2,2,1,2,1,2,1,2,3,3,1,3, %T A347342 1,3,1,3,3,1,3,1,3,1,1,3,3,3,3,1,1,3,1,3,1,3,1,3,1,1,3,1,3,3,1,1,3,1, %U A347342 2,1,1,3,2,3,4,3,4,2,1,4,4,1,1,3,4,3 %N A347342 a(n) = prime(n) mod floor(prime(n) / n). %H A347342 Simon Strandgaard, <a href="/A347342/a347342.png">Plot of 1000 terms</a> %F A347342 a(n) = A000040(n) mod A038605(n). %e A347342 a(1) = 2 mod floor( 2 / 1) = 2 mod 2 = 0, %e A347342 a(2) = 3 mod floor( 3 / 2) = 3 mod 1 = 0, %e A347342 a(3) = 5 mod floor( 5 / 3) = 5 mod 1 = 0, %e A347342 a(4) = 7 mod floor( 7 / 4) = 7 mod 1 = 0, %e A347342 a(5) = 11 mod floor(11 / 5) = 11 mod 2 = 1. %t A347342 A347342[n_] := Mod[Prime[n] , Floor[Prime[n]/n]]; Table[A347342[n], {n, 1, 86}] (* _Robert P. P. McKone_, Aug 27 2021 *) %o A347342 (PARI) a(n) = prime(n) % (prime(n) \ n); %o A347342 (Ruby) require 'prime' %o A347342 values = [] %o A347342 Prime.first(30).each_with_index do |prime,i| %o A347342 values << prime % (prime/(i+1)) %o A347342 end %o A347342 p values %Y A347342 Cf. A000040, A038605. %K A347342 nonn %O A347342 1,13 %A A347342 _Simon Strandgaard_, Aug 27 2021