[go: up one dir, main page]

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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A361127 Let p = n-th odd prime; a(n) = index where 2*p appears in A360519, or -1 if 2*p never appears. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
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.
LINKS
EXAMPLE
p = 11 is the 4th odd prime, and A360519(16) = 2*11 = 22, so a(4) = 16.
CROSSREFS
Sequence in context: A071012 A354742 A228520 * A280969 A349565 A091734
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 15:13 EDT 2024. Contains 375545 sequences. (Running on oeis4.)