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.

A220187 Smallest integer m such that number of representations of 2 m + 1 as p + 4 q is n, with p, q primes.

Original entry on oeis.org

5, 9, 12, 24, 37, 43, 40, 67, 88, 97, 109, 127, 145, 160, 199, 157, 217, 316, 262, 232, 220, 277, 307, 352, 388, 451, 397, 427, 568, 412, 562, 367, 556, 532, 472, 652, 724, 697, 637, 667, 808, 757, 871, 577, 682, 1081, 1264, 967, 787, 952, 1057, 907, 1087, 1117, 1012, 1102, 1333, 1147, 1252, 892, 1543, 997, 1342, 1237, 1327
Offset: 1

Views

Author

Zak Seidov, Apr 13 2013

Keywords

Examples

			a(2) = 9 because 19 = 7 + 4*3 = 11 + 4*2 (2 representations),
a(3) = 12 because 25 = 5 + 4*5 = 13 + 4*3 = 17 + 4*2 (3 representations).
		

Crossrefs

Cf. A219254 Number of representations of 2n+1 as p+4q.