A085909 -id:A085909 - cp's OEIS frontend

A258576 a(n) = A085909(n) - prime(n).

2, 6, 6, 6, 6, 12, 18, 8, 12, 16, 6, 18, 24, 6, 8, 12, 12, 12, 30, 10, 18, 48, 270, 6, 6, 6, 30, 18, 180, 36, 20, 12, 42, 30, 6, 10, 30, 6, 60, 12, 60, 6, 30, 30, 12, 256, 6, 12, 48, 18, 30, 42, 6, 6, 8, 12, 60, 30, 30, 54, 24, 6, 36, 36, 456, 22, 72, 72, 30

Offset: 2

Zak Seidov, Jun 04 2015

nonn

Apparently a(n) (and A085909(n)) exists for all n.

			a(2) = A085909(2)-prime(2) = 5-3 = 2, a(3) = A085909(3)-prime(3) = 11-5 = 6,
a(10^9) = A085909(10^9)-prime(10^9) = 22801763867-22801763489 = 24.

Zak Seidov, Table of n, a(n) for n = 2..1000

Cf. A085909, A000040.

A090320 Duplicate of A085909.

Original entry on oeis.org

0, 5, 11, 13, 17, 19, 29, 37, 31, 41, 47, 43, 59, 67, 53, 61, 71, 73, 79, 101, 83, 97, 131

Offset: 1

dead

A085910 a(n) = smallest prime(k) not equal to prime(n) and not included earlier, such that A001223(k) = A001223(n), i.e., prime(k+1) - prime(k) = prime(n+1) - prime(n).

Original entry on oeis.org

5, 3, 13, 17, 7, 11, 37, 31, 41, 23, 19, 29, 67, 53, 47, 71, 73, 43, 59, 61, 97, 131, 359, 79, 107, 109, 101, 103, 293, 163, 83, 149, 181, 137, 157, 151, 127, 173, 167, 191, 139, 179, 223, 227, 211, 199, 193, 197, 277, 251, 269, 283, 233, 263, 257, 239, 331, 229, 311

Offset: 0

Amarnath Murthy, Jul 09 2003

nonn

a(1) = 0. Conjecture: a rearrangement of odd primes for n > 1.

Cf. A085909.

Corrected and extended by David Wasserman, Feb 24 2004

cp's OEIS Frontend

A258576 a(n) = A085909(n) - prime(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A090320 Duplicate of A085909.

Views

Author

Keywords

A085910 a(n) = smallest prime(k) not equal to prime(n) and not included earlier, such that A001223(k) = A001223(n), i.e., prime(k+1) - prime(k) = prime(n+1) - prime(n).

Views

Author

Keywords

Comments

Crossrefs

Extensions