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.

A358545 a(n) is the smallest number with exactly n divisors that are centered square numbers.

This page as a plain text file.
%I A358545 #26 Feb 16 2025 08:34:04
%S A358545 1,5,25,325,1625,1105,5525,27625,160225,1022125,801125,5928325,
%T A358545 8491925,29641625,42459625,444215525,314201225,2003613625,1571006125,
%U A358545 14826740825,12882250225,127081657625,64411251125,88717383625
%N A358545 a(n) is the smallest number with exactly n divisors that are centered square numbers.
%C A358545 Any subsequent terms are > 10^10. - _Lucas A. Brown_, Dec 24 2022
%H A358545 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/figuratedivisors.py">Python program</a>.
%H A358545 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CenteredSquareNumber.html">Centered Square Number</a>
%H A358545 <a href="/index/Di#divisors">Index entries for sequences related to divisors of numbers</a>
%e A358545 a(3) = 25 because 25 has 3 centered square divisors {1, 5, 25} and this is the smallest such number.
%o A358545 (PARI) iscsq(n) = issquare(2*n-1); \\ A001844
%o A358545 a(n) = my(k=1); while (sumdiv(k, d, iscsq(d)) != n, k++); k; \\ _Michel Marcus_, Nov 21 2022
%Y A358545 Cf. A001844, A005179, A130279, A300410, A358543, A358544.
%K A358545 nonn,more
%O A358545 1,2
%A A358545 _Ilya Gutkovskiy_, Nov 21 2022
%E A358545 a(12)-a(15) from _Michel Marcus_, Nov 21 2022
%E A358545 a(16) from _Martin Ehrenstein_, Dec 02 2022
%E A358545 a(17)-a(24) from _Jinyuan Wang_, Dec 02 2022