The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A347342 revision #10

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,13

LINKS

Table of n, a(n) for n=1..86.

Simon Strandgaard, Plot of 1000 terms

FORMULA

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

EXAMPLE

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.

MATHEMATICA

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

PROG

(PARI) a(n) = prime(n) % floor(prime(n) / n);

(Ruby) require 'prime'

values = []

Prime.first(30).each_with_index do |prime, i|

values << prime % (prime/(i+1))

end

p values

CROSSREFS

Cf. A000040, A038605.

Sequence in context: A106028 A105307 A281012 * A304943 A248597 A082071

Adjacent sequences: A347339 A347340 A347341 * A347343 A347344 A347345

KEYWORD

nonn

AUTHOR

Simon Strandgaard, Aug 27 2021

STATUS

editing