cp's OEIS Frontend

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.

A361127 Let p = n-th odd prime; a(n) = index where 2*p appears in A360519, or -1 if 2*p never appears.

Original entry on oeis.org

2, 3, 11, 16, 28, 24, 32, 40, 48, 51, 55, 59, 84, 96, 104, 120, 123, 127, 144, 148, 160, 164, 176, 200, 203, 207, 208, 211, 236, 252, 260, 276, 280, 304, 308, 312, 332, 336, 344, 368, 376, 388, 392, 400, 404, 428, 452, 468, 472, 480, 496, 500, 508, 520, 532, 556, 560
Offset: 1

Views

Author

Keywords

Comments

It is conjectured that every 2*prime(n) (n>1) appears in A360519. A proof of this would be a big step towards proving that every term of C appears in A360519.

Examples

			p = 11 is the 4th odd prime, and A360519(16) = 2*11 = 22, so a(4) = 16.
		

Crossrefs