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.

A358929 a(n) is the smallest centered triangular number with exactly n prime factors (counted with multiplicity).

Original entry on oeis.org

1, 19, 4, 316, 136, 760, 64, 4960, 22144, 103360, 27136, 5492224, 1186816, 41414656, 271212544, 559980544, 1334788096, 12943360, 7032930304, 527049293824, 158186536960, 1096295120896, 7871801589760, 154690378792960, 13071965224960, 56262393856, 964655941943296
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 06 2022

Keywords

Examples

			a(4) = 136, because 136 is a centered triangular number with 4 prime factors (counted with multiplicity) {2, 2, 2, 17} and this is the smallest such number.
		

Crossrefs

Programs

  • Mathematica
    c[k_] := (3*k^2 + 3*k + 2)/2; a[n_] := Module[{k = 0, ck}, While[PrimeOmega[ck = c[k]] != n, k++]; ck]; Array[a, 18, 0] (* Amiram Eldar, Dec 09 2022 *)
  • PARI
    a(n) = if(n==0, return(1)); for(k=1, oo, my(t=3*k*(k+1)/2 + 1); if(bigomega(t) == n, return(t))); \\ Daniel Suteu, Dec 10 2022

Extensions

a(22)-a(26) from Daniel Suteu, Dec 10 2022

A359090 a(n) is the index of the smallest tetrahedral number with exactly n prime factors (counted with multiplicity), or -1 if no such number exists.

Original entry on oeis.org

1, -1, 2, 4, 6, 8, 14, 30, 48, 62, 126, 160, 350, 510, 1022, 2046, 1024, 4095, 4094, 13310, 28672, 32768, 65534, 180224, 262142, 360448, 262143, 2097151, 3276800, 4194302, 2097150, 33554432, 16777214, 66715648, 33554430, 184549374, 134217728, 536870910, 1073741824
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 16 2022

Keywords

Crossrefs

Programs

  • PARI
    a(n) = if(n==1, return(-1)); for(k=1, oo, my(t=(k*(k+1)*(k+2))\6); if(bigomega(t) == n, return(k))); \\ Daniel Suteu, Dec 30 2022

Extensions

a(27)-a(34) from Daniel Suteu, Dec 30 2022
a(35)-a(38) from Lucas A. Brown, Sep 11 2024

A359192 a(n) is the smallest square pyramidal number with exactly n prime factors (counted with multiplicity).

Original entry on oeis.org

1, 5, 14, 30, 140, 1240, 4900, 10416, 85344, 173880, 1801800, 5559680, 44608256, 357389824, 44870400, 110099203200, 2861214720, 98269966080, 982218617856, 1466149724160, 11727587164160, 243912389529600, 750591347982336, 1951282875801600, 37635982963937280, 460962807482777600
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 19 2022

Keywords

Examples

			a(4) = 140, because 140 is a square pyramidal number with 4 prime factors (counted with multiplicity) {2, 2, 5, 7} and this is the smallest such number.
		

Crossrefs

Programs

  • PARI
    sp(n) = n*(n+1)*(2*n+1)/6; \\ A000330
    a(n) = my(k=1); while (bigomega(sp(k)) != n, k++); sp(k); \\ Michel Marcus, Dec 20 2022
Showing 1-3 of 3 results.