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.

A364166 Indices k such that A002375(k) = A002375(k+1) = number of decompositions of 2k into a sum of two odd primes.

Original entry on oeis.org

1, 3, 7, 8, 9, 11, 12, 17, 37, 58, 88, 103, 112, 118, 160, 196, 226, 247, 277, 283, 343, 382, 415, 455, 463, 502, 523, 532, 553, 592, 598, 613, 652, 667, 670, 682, 697, 751, 770, 817, 895, 901, 1012, 1018, 1048, 1123, 1153, 1198, 1318, 1393, 1420, 1708, 1831, 1942, 1972
Offset: 1

Views

Author

M. F. Hasler, Jul 12 2023

Keywords

Comments

Related to the Goldbach conjecture and to the open question (as of today) whether there are two consecutive integers > 11 in this sequence.

Crossrefs

Cf. A002375.

Programs

  • PARI
    [i-1|i<-[2..#A=A002375], A[i-1]==A[i]] \\ where the list A002375 must be defined e.g. by reading the b-file for that sequence.