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 21-30 of 38 results. Next

A024596 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A014306.

Original entry on oeis.org

0, 1, 3, 2, 4, 3, 6, 11, 19, 18, 30, 29, 48, 45, 74, 66, 108, 87, 142, 230, 373, 372, 603, 600, 972, 964, 1561, 1540, 2493, 2438, 3946, 3802, 6153, 5776, 9346, 8358, 13525, 10939, 17701, 28642, 46345, 46332, 74968, 74934, 121247, 121158, 196039, 195806
Offset: 1

Views

Author

Keywords

A024602 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A014306.

Original entry on oeis.org

0, 1, 4, 3, 6, 4, 9, 16, 25, 24, 33, 31, 42, 40, 53, 51, 66, 64, 81, 99, 118, 116, 137, 135, 158, 156, 181, 179, 206, 204, 233, 231, 262, 260, 292, 288, 321, 317, 352, 389, 428, 426, 467, 465, 508, 506, 551, 549, 596, 594, 643, 641, 692, 690, 743, 740, 793, 789, 844, 840
Offset: 1

Views

Author

Keywords

Extensions

a(59) corrected by Sean A. Irvine, Jul 17 2019

A024688 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence), t = A014306.

Original entry on oeis.org

0, 1, 4, 3, 5, 4, 8, 14, 22, 21, 28, 27, 36, 34, 45, 43, 56, 54, 68, 83, 98, 97, 114, 112, 132, 130, 151, 149, 171, 170, 193, 191, 217, 215, 242, 238, 265, 262, 290, 321, 352, 351, 384, 382, 418, 416, 452, 451, 489, 488, 528, 526, 568, 566, 610, 607, 649, 647, 691, 687, 735
Offset: 1

Views

Author

Keywords

A024691 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence), t = A014306.

Original entry on oeis.org

0, 2, 7, 5, 9, 7, 14, 24, 37, 35, 47, 45, 60, 57, 75, 72, 93, 90, 113, 137, 162, 160, 188, 185, 217, 214, 248, 245, 281, 279, 317, 314, 356, 353, 396, 390, 434, 429, 475, 525, 576, 574, 628, 625, 683, 680, 739, 737, 799, 797, 862, 859, 927, 924, 995, 990, 1059, 1055
Offset: 1

Views

Author

Keywords

Crossrefs

Extensions

a(46) corrected by Sean A. Irvine, Jul 20 2019

A024695 s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A014306.

Original entry on oeis.org

0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 5, 4, 5, 5, 6, 6, 7, 7, 7, 7, 9, 8, 9, 9, 10, 10, 12, 11, 12, 12, 13, 13, 14, 13, 14, 15, 15, 15, 16, 16, 17, 18, 18, 18, 19, 19, 20, 20, 21, 21, 22, 23, 23, 23, 23, 23, 25, 24, 25, 25, 26, 26, 28, 27, 28, 28, 29, 29, 30, 30, 31, 31, 33, 32, 33, 33, 34, 34, 35
Offset: 1

Views

Author

Keywords

A024696 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).

Original entry on oeis.org

0, 0, 3, 5, 12, 18, 24, 30, 47, 55, 82, 96, 127, 149, 186, 210, 261, 293, 319, 349, 412, 444, 517, 557, 634, 680, 773, 819, 918, 976, 1079, 1147, 1268, 1324, 1455, 1535, 1680, 1758, 1844, 1918, 2075, 2167, 2334, 2422, 2607, 2703, 2890, 3002, 3213, 3311, 3522, 3634
Offset: 1

Views

Author

Keywords

A024866 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A014306.

Original entry on oeis.org

1, 1, 2, 1, 3, 6, 10, 10, 14, 13, 18, 17, 23, 22, 29, 28, 36, 45, 54, 53, 63, 62, 73, 72, 84, 83, 96, 95, 109, 108, 123, 122, 138, 136, 152, 150, 167, 185, 204, 203, 223, 222, 243, 242, 264, 263, 286, 285, 309, 308, 333, 332, 358, 357, 383, 381, 408, 406, 434, 432, 461, 459, 489
Offset: 2

Views

Author

Keywords

A025076 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = A014306.

Original entry on oeis.org

1, 1, 0, 1, 1, 2, 3, 3, 2, 3, 3, 3, 5, 4, 5, 5, 6, 6, 6, 7, 7, 7, 9, 8, 9, 9, 10, 9, 10, 10, 11, 12, 12, 11, 13, 12, 13, 15, 14, 14, 15, 16, 16, 16, 17, 17, 19, 18, 19, 19, 20, 20, 21, 20, 20, 21, 21, 21, 23, 23, 23, 23, 25, 24, 25, 25, 26, 28, 27, 27, 28, 28, 29, 30, 30, 30, 31, 31, 32, 32, 34, 33, 33, 34
Offset: 1

Views

Author

Keywords

A025087 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A014306.

Original entry on oeis.org

1, 1, 1, 1, 2, 4, 7, 7, 11, 11, 18, 17, 28, 25, 41, 33, 54, 88, 142, 142, 230, 229, 371, 368, 596, 588, 952, 931, 1507, 1452, 2350, 2206, 3570, 3192, 5166, 4178, 6761, 10940, 17702, 17697, 28635, 28622, 46312, 46278, 74880, 74791, 121015, 120782, 195430, 194820, 315226
Offset: 1

Views

Author

Keywords

A025097 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = A014306.

Original entry on oeis.org

1, 1, 3, 1, 4, 8, 15, 15, 25, 23, 40, 37, 62, 55, 91, 73, 120, 196, 318, 316, 514, 511, 829, 822, 1332, 1314, 2128, 2081, 3369, 3246, 5254, 4932, 7982, 7138, 11550, 9342, 15117, 24462, 39582, 39571, 64029, 64000, 103556, 103480, 167436, 167237, 270597, 270076, 436994
Offset: 1

Views

Author

Keywords

Previous Showing 21-30 of 38 results. Next