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.

Previous Showing 11-12 of 12 results.

A048223 a(n)=T(n,1)+T(n,n), array T given by A048212.

Original entry on oeis.org

4, 4, 11, 19, 29, 39, 54, 72, 89, 113, 137, 163, 189, 216, 254, 288, 323, 363, 402, 446, 495, 544, 593, 651, 710, 772, 835, 898, 964, 1036, 1106, 1185, 1263, 1341, 1420, 1504, 1591, 1681, 1770, 1860, 1963, 2063, 2165, 2271, 2378
Offset: 1

Views

Author

Clark Kimberling

Keywords

Crossrefs

Cf. A004979.

Formula

a(n) = 2*A004979(n+1) - A004979(n) - 1. - Sean A. Irvine, Jun 05 2021

A004979 a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=1, a(2)=3.

Original entry on oeis.org

1, 3, 4, 8, 14, 22, 31, 43, 58, 74, 94, 116, 140, 165, 191, 223, 256, 290, 327, 365, 406, 451, 498, 546, 599, 655, 714, 775, 837, 901, 969, 1038, 1112, 1188, 1265, 1343, 1424, 1508, 1595, 1683, 1772, 1868, 1966, 2066, 2169, 2274
Offset: 1

Views

Author

Clark Kimberling

Keywords

Crossrefs

Cf. A048212, A048216, A048217.
Previous Showing 11-12 of 12 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.