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

A358540 a(n) is the smallest number with exactly n divisors that are n-gonal pyramidal numbers.

Original entry on oeis.org

56, 140, 1440, 11550, 351120, 41580, 742560, 29279250, 8316000, 72348396120, 3386892600, 578918340
Offset: 3

Views

Author

Ilya Gutkovskiy, Nov 21 2022

Keywords

Comments

Any subsequent terms are > 2 * 10^9. - Lucas A. Brown, Dec 24 2022

Examples

			a(5) = 1440 because 1440 has 5 pentagonal pyramidal divisors {1, 6, 18, 40, 288} and this is the smallest such number.
		

Crossrefs

Extensions

a(11)-a(13) from Martin Ehrenstein, Dec 02 2022
a(14) from Lucas A. Brown, Dec 19 2022

A358541 a(n) is the smallest number with exactly n divisors that are centered n-gonal numbers.

Original entry on oeis.org

20, 325, 912, 43771, 234784, 11025, 680680, 9143308361, 2470852896
Offset: 3

Views

Author

Ilya Gutkovskiy, Nov 21 2022

Keywords

Comments

Any subsequent terms are > 10^10. - Lucas A. Brown, Dec 24 2022

Examples

			a(5) = 912 because 912 has 5 centered pentagonal divisors {1, 6, 16, 76, 456} and this is the smallest such number.
		

Crossrefs

Extensions

a(10)-a(11) from Martin Ehrenstein, Dec 04 2022

A358859 a(n) is the smallest n-gonal number divisible by exactly n n-gonal numbers.

Original entry on oeis.org

6, 36, 210, 4560, 6426, 326040, 4232250, 1969110, 296676380, 4798080, 166289760, 73765692000, 712750500, 50561280, 33944067893736, 2139168754800, 4292572951800, 1414764341760, 72461756727360, 180975331456920, 1870768457500800, 5498331930000, 153698278734000
Offset: 3

Views

Author

Ilya Gutkovskiy, Dec 03 2022

Keywords

Comments

The corresponding indices of n-gonal numbers are 3, 6, 12, 48, 51, 330, 1100, 702, ...

Examples

			a(5) = 210, because 210 is a pentagonal number that has 5 pentagonal divisors {1, 5, 35, 70, 210} and this is the smallest such number.
		

Crossrefs

Programs

  • PARI
    a(n) = if(n<3, return()); for(k=1, oo, my(t=(k*(n*k - n - 2*k + 4))\2); if(sumdiv(t, d, ispolygonal(d, n)) == n, return(t))); \\ Daniel Suteu, Dec 04 2022

Extensions

a(11)-a(25) from Daniel Suteu, Dec 04 2022
Showing 1-3 of 3 results.