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.

Showing 1-1 of 1 results.

A316338 Numbers missing from A316328.

Original entry on oeis.org

960, 961, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1359, 1360, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1373, 1374, 1376, 1442, 1443, 1444, 1445, 1446, 1508, 1509, 1510, 1511, 1512, 1513, 1514, 1515
Offset: 1

Views

Author

N. J. A. Sloane, Jul 14 2018

Keywords

Comments

A316328 is finite, so this sequence is infinite.
See A316667 and A316328 for further information.
A316328 has 2016 terms including the initial 0, and the largest term is 3198. Therefore this sequence contains all numbers > 3198 and 3198 - 2015 = 1183 smaller positive terms, whence the formula. - M. F. Hasler, Nov 05 2019

Crossrefs

Cf. A316588, A316667, A316337, A316328.

Formula

a(n + 1183) = n + 3198 for all n > 0. - M. F. Hasler, Nov 05 2019
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.