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.

A364586 a(n) is the least number with exactly n divisors of the form 5*k+1.

Original entry on oeis.org

1, 6, 36, 66, 252, 336, 672, 1008, 3528, 2016, 4032, 3696, 9072, 7392, 13104, 11088, 36288, 38304, 26208, 22176, 68544, 44352, 91728, 66528, 154224, 99792, 209664, 96096, 301392, 144144, 222768, 188496, 487872, 399168, 471744, 421344, 1079568, 288288, 1097712, 432432
Offset: 1

Views

Author

Ilya Gutkovskiy, Jul 28 2023

Keywords

Crossrefs

Programs

  • PARI
    a(n) = my(k=1); while (sumdiv(k, d, (d%5)==1) != n, k++); k; \\ Michel Marcus, Jul 29 2023
    
  • PARI
    list(nmax) = {my(v = vector(nmax), c = 0, k = 1, i); while(c < nmax, i = sumdiv(k, d, d % 5 == 1); if(i <= nmax && v[i] == 0, c++; v[i] = k); k++); v;} \\ Amiram Eldar, Jan 28 2025

A364598 a(n) is the least number with exactly n divisors of the form 5*k+2.

Original entry on oeis.org

1, 2, 12, 42, 84, 252, 462, 672, 924, 2016, 2772, 4032, 5544, 9072, 7392, 17136, 14784, 26208, 22176, 34272, 33264, 52416, 44352, 119952, 66528, 117936, 99792, 183456, 125664, 222768, 188496, 235872, 199584, 487872, 288288, 616896, 399168, 1206576, 376992, 1097712, 432432
Offset: 0

Views

Author

Ilya Gutkovskiy, Jul 29 2023

Keywords

Crossrefs

Programs

  • PARI
    list(nmax) = {my(v = vector(nmax+1), c = 0, k = 1, i); while(c < nmax+1, i = sumdiv(k, d, d % 5 == 2) + 1; if(i <= nmax+1 && v[i] == 0, c++; v[i] = k); k++); v;} \\ Amiram Eldar, Jan 28 2025

A364599 a(n) is the least number with exactly n divisors of the form 5*k+3.

Original entry on oeis.org

1, 3, 18, 48, 144, 288, 504, 1248, 1008, 2016, 3024, 4368, 5544, 14112, 12096, 17136, 11088, 34272, 22176, 26208, 33264, 52416, 48048, 91728, 66528, 117936, 155232, 183456, 133056, 235872, 188496, 222768, 144144, 528528, 376992, 616896, 421344, 825552, 288288, 1707552, 432432
Offset: 0

Views

Author

Ilya Gutkovskiy, Jul 29 2023

Keywords

Crossrefs

Programs

  • PARI
    list(nmax) = {my(v = vector(nmax+1), c = 0, k = 1, i); while(c < nmax+1, i = sumdiv(k, d, d % 5 == 3) + 1; if(i <= nmax+1 && v[i] == 0, c++; v[i] = k); k++); v;} \\ Amiram Eldar, Jan 28 2025
Showing 1-3 of 3 results.