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.

A002092 From a Goldbach conjecture: records in A185091.

This page as a plain text file.
%I A002092 M2424 N0959 #45 Oct 14 2023 23:45:24
%S A002092 1,3,5,7,17,29,47,61,73,83,277,317,349,419,503,601,709,829,877,1129,
%T A002092 1237,1367,1429,1669,1801,2467,2833,2879,3001,3037,3329,3821,4861,
%U A002092 5003,5281,5821,5897,6301,6329,6421,6481,6841,7069,7121,7309,7873,8017,8597,8821
%N A002092 From a Goldbach conjecture: records in A185091.
%C A002092 See A002091. The sequence gives the record values of q in the representations minimizing q of 2*k+1 = 2*p+q, p prime, q {1,prime}.
%C A002092 Checked up to 2*k = 10^13.
%D A002092 Brian H. Mayoh, On the second Goldbach conjecture. Nordisk Tidskr. Informations-Behandling 6, 1966, pp. 48-50.
%D A002092 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A002092 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A002092 See A002091.
%H A002092 <a href="/index/Go#Goldbach">Index entries for sequences related to Goldbach conjecture</a>
%F A002092 a(n) = A185091((A002091(n)+1)/2).
%Y A002092 Cf. A002372, A002373, A002374, A002375, A045917, A006307, A002091, A185091, A194828, A194829.
%K A002092 nonn
%O A002092 1,2
%A A002092 _N. J. A. Sloane_
%E A002092 Comment added, a(19)-a(32) from _Hugo Pfoertner_, Sep 03 2011
%E A002092 a(33) from Jason Kimberley, a(34)-a(40) from _Hugo Pfoertner_, Sep 09 2011
%E A002092 a(41)-a(49) from _Hugo Pfoertner_, Sep 25 2011