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-10 of 10 results.

A048150 a(n)=number of numbers h^2+k^2 that are <=2n^2; equivalently, a(n)=T(n,n), array T as in A048149.

Original entry on oeis.org

1, 4, 9, 20, 31, 48, 65, 86, 113, 140, 173, 206, 239, 286, 327, 378, 425, 478, 533, 590, 659, 722, 793, 862, 933, 1020, 1099, 1184, 1271, 1360, 1455, 1550, 1655, 1758, 1865, 1976, 2079, 2202, 2319, 2448, 2569, 2694, 2827, 2960
Offset: 0

Views

Author

Clark Kimberling

Keywords

A049712 a(n) = Sum_{i=0..n} T(i,n-i), array T as in A048149.

Original entry on oeis.org

1, 6, 16, 38, 69, 120, 190, 276, 387, 542, 714, 924, 1161, 1456, 1794, 2174, 2597, 3084, 3620, 4230, 4891, 5610, 6418, 7292, 8213, 9248, 10366, 11566, 12827, 14200, 15664, 17228, 18865, 20690, 22546, 24498, 26625, 28826
Offset: 0

Views

Author

Clark Kimberling

Keywords

A049713 a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A048149.

Original entry on oeis.org

1, 8, 17, 38, 63, 102, 121, 170, 217, 276, 359, 422, 473, 562, 643, 776, 861, 966, 1041, 1176, 1303, 1468, 1569, 1712, 1825, 2056, 2225, 2358, 2565, 2722, 2877, 3116, 3301, 3540, 3681, 3982, 4145, 4446, 4631, 4984, 5161, 5314
Offset: 0

Views

Author

Clark Kimberling

Keywords

A049714 a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A048149.

Original entry on oeis.org

1, 3, 12, 19, 43, 60, 114, 138, 225, 271, 408, 462, 641, 728, 982, 1087, 1407, 1542, 1948, 2115, 2625, 2805, 3420, 3646, 4343, 4624, 5464, 5783, 6735, 7100, 8220, 8614, 9863, 10345, 11756, 12249, 13833, 14413, 16158, 16814
Offset: 0

Views

Author

Clark Kimberling

Keywords

A049717 a(n) = T(n,n+1), array T as in A048149.

Original entry on oeis.org

3, 8, 15, 26, 41, 56, 79, 100, 127, 158, 189, 228, 263, 308, 351, 398, 455, 508, 567, 626, 687, 760, 827, 906, 977, 1060, 1143, 1224, 1323, 1408, 1507, 1604, 1701, 1810, 1917, 2030, 2149, 2264, 2387, 2502, 2639, 2768, 2899, 3036
Offset: 0

Views

Author

Clark Kimberling

Keywords

Crossrefs

Cf. A048149.

A049718 a(n)=T(n,n+2), array T as in A048149.

Original entry on oeis.org

6, 13, 22, 33, 50, 69, 90, 117, 142, 175, 208, 247, 290, 329, 380, 427, 482, 539, 592, 663, 726, 797, 866, 937, 1022, 1101, 1188, 1275, 1362, 1461, 1554, 1661, 1762, 1871, 1978, 2083, 2206, 2325, 2450, 2571, 2698, 2833, 2966
Offset: 0

Views

Author

Clark Kimberling

Keywords

A049719 a(n)=T(n,n+3), array T as in A048149.

Original entry on oeis.org

11, 19, 30, 43, 62, 81, 104, 133, 162, 193, 230, 267, 310, 359, 406, 459, 510, 571, 630, 695, 764, 829, 910, 983, 1064, 1145, 1230, 1325, 1414, 1513, 1608, 1707, 1816, 1923, 2040, 2153, 2266, 2389, 2508, 2645, 2770, 2903, 3038
Offset: 0

Views

Author

Clark Kimberling

Keywords

A049720 a(n)=T(n,1), array T as in A048149.

Original entry on oeis.org

3, 4, 8, 13, 19, 28, 37, 48, 62, 75, 92, 108, 127, 150, 170, 195, 218, 247, 277, 304, 337, 369, 406, 441, 475, 518, 559, 604, 646, 689, 740, 786, 841, 890, 945, 1001, 1052, 1115, 1173, 1236, 1299, 1360, 1428, 1497, 1568, 1638, 1707
Offset: 0

Views

Author

Clark Kimberling

Keywords

A049721 a(n)=T(n,2), array T as in A048149.

Original entry on oeis.org

6, 8, 9, 15, 22, 30, 39, 52, 64, 79, 94, 112, 131, 152, 173, 197, 222, 251, 279, 308, 339, 373, 408, 445, 482, 524, 563, 606, 648, 695, 742, 792, 843, 892, 949, 1003, 1058, 1117, 1175, 1242, 1303, 1366, 1432, 1501, 1572, 1640, 1711
Offset: 0

Views

Author

Clark Kimberling

Keywords

A049722 a(n)=T(n,3), array T as in A048149.

Original entry on oeis.org

11, 13, 15, 20, 26, 33, 43, 54, 67, 83, 98, 117, 135, 154, 179, 203, 228, 255, 281, 314, 343, 378, 414, 447, 488, 526, 567, 608, 652, 703, 748, 797, 845, 898, 953, 1007, 1064, 1123, 1183, 1246, 1305, 1372, 1438, 1505, 1576, 1642
Offset: 0

Views

Author

Clark Kimberling

Keywords

Showing 1-10 of 10 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.