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

A334007 a(n) is the least integer that can be expressed as the sum of one or more consecutive nonzero triangular numbers in exactly n ways.

Original entry on oeis.org

1, 10, 2180, 10053736, 13291443468940
Offset: 1

Views

Author

Ilya Gutkovskiy, Apr 12 2020

Keywords

Examples

			Let S(k, m) denote the sum of m triangular numbers starting from k(k+1)/2. We have
a(1) = S(1, 1);
a(2) = S(4, 1) = S(1, 3);
a(3) = S(31, 4) = S(27, 5) = S(9, 15);
a(4) = S(945, 22) = S(571, 56) = S(968, 21) = S(131, 266);
a(5) = S(4109, 38947) = S(25213, 20540) = S(10296, 32943) = S(32801, 15834) = S(31654, 16472).
		

Crossrefs

Extensions

a(5) from Giovanni Resta, Apr 13 2020

A334012 a(n) is the least integer that can be expressed as the sum of one or more consecutive nonzero octagonal numbers in exactly n ways.

Original entry on oeis.org

1, 1045, 5985
Offset: 1

Views

Author

Ilya Gutkovskiy, Apr 12 2020

Keywords

Examples

			From _Seiichi Manyama_, May 16 2021: (Start)
Let S(k, m) denote the sum of m octagonal numbers starting from k*(3*k-2). We have
a(1) = S(1, 1);
a(2) = S(19, 1) = S(1, 10);
a(3) = S(45, 1) = S(11, 9) = S(1, 18). (End)
		

Crossrefs

A334008 a(n) is the least integer that can be expressed as the sum of one or more consecutive nonzero pentagonal numbers in exactly n ways.

Original entry on oeis.org

1, 287, 472320, 89051435880
Offset: 1

Views

Author

Ilya Gutkovskiy, Apr 12 2020

Keywords

Examples

			Let S(k, m) denote the sum of m pentagonal numbers starting from the k-th. We have
a(1) = S(1, 1);
a(2) = S(14, 1) = S(2, 7);
a(3) = S(103, 24) = S(19, 80) = S(67, 41);
a(4) = S(10833, 484) = S(4542, 1936) = S(9153, 660) = S(2817, 3036);
		

Crossrefs

Extensions

a(4) from Giovanni Resta, Apr 13 2020

A334011 a(n) is the least integer that can be expressed as the sum of one or more consecutive nonzero heptagonal numbers in exactly n ways.

Original entry on oeis.org

1, 872, 8240232, 263346158075
Offset: 1

Views

Author

Ilya Gutkovskiy, Apr 12 2020

Keywords

Examples

			Let S(k, m) denote the sum of m heptagonal numbers starting from the k-th. We have
a(1) = S(1, 1);
a(2) = S(13, 2) = S(3, 8);
a(3) = S(133, 98) = S(479, 14) = S(168, 77);
a(4) = S(6773, 1785) = S(810, 6006) = S(7467, 1547) = S(38758, 70).
		

Crossrefs

Extensions

a(4) from Giovanni Resta, Apr 14 2020

A334035 a(n) is the least integer that can be expressed as the difference of two hexagonal numbers in exactly n ways.

Original entry on oeis.org

1, 45, 225, 585, 2415, 4725, 9945, 10395, 31185, 28665, 45045, 58905, 143325, 257985, 135135, 225225, 329175, 487305, 405405, 831285, 1091475, 675675, 1396395, 1576575, 2927925, 3132675, 2436525, 2027025, 2567565, 2297295, 6235515, 5360355, 4729725, 3828825, 10503675
Offset: 1

Views

Author

Ilya Gutkovskiy, Apr 12 2020

Keywords

Comments

The least integer that can be expressed as the sum of one or more consecutive numbers congruent to 1 mod 4 in exactly n ways.
Index of first occurrence of n in A333816.

Crossrefs

Programs

  • Mathematica
    nmax = 10000; A333816 = Rest[CoefficientList[Series[Sum[x^(k*(2*k - 1))/(1 - x^(4*k)), {k, 1, 1 + Sqrt[nmax/2]}], {x, 0, nmax}], x]]; Flatten[Table[FirstPosition[A333816, k], {k, 1, Max[A333816]}]] (* Vaclav Kotesovec, Apr 19 2020 *)

Extensions

More terms from Jinyuan Wang, Apr 13 2020

A343777 a(n) is the least integer that can be expressed as the sum of one or more consecutive nonzero n-gonal numbers in exactly n ways.

Original entry on oeis.org

2180, 554503705
Offset: 3

Views

Author

Ilya Gutkovskiy, Apr 30 2021

Keywords

Crossrefs

Showing 1-6 of 6 results.