A347342 a(n) = prime(n) mod floor(prime(n) / n).

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, 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, 2, 1, 1, 3, 2, 3, 4, 3, 4, 2, 1, 4, 4, 1, 1, 3, 4, 3

Offset: 1

Author

Simon Strandgaard, Aug 27 2021

Keywords

• nonn

Examples

			a(1) =  2 mod floor( 2 / 1) =  2 mod 2 = 0,
a(2) =  3 mod floor( 3 / 2) =  3 mod 1 = 0,
a(3) =  5 mod floor( 5 / 3) =  5 mod 1 = 0,
a(4) =  7 mod floor( 7 / 4) =  7 mod 1 = 0,
a(5) = 11 mod floor(11 / 5) = 11 mod 2 = 1.
		

Links

• Simon Strandgaard, Plot of 1000 terms

Crossrefs

Cf. A000040, A038605.

Programs

Mathematica

A347342[n_] := Mod[Prime[n] , Floor[Prime[n]/n]]; Table[A347342[n], {n, 1, 86}] (* Robert P. P. McKone, Aug 27 2021 *)

PARI

a(n) = prime(n) % (prime(n) \ n);

Ruby

require 'prime'
values = []
Prime.first(30).each_with_index do |prime,i|
    values << prime % (prime/(i+1))
end
p values

Formula

a(n) = A000040(n) mod A038605(n).