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.
%I A244964 #18 Dec 31 2023 03:40:59
%S A244964 1,2,1,2,2,2,2,2,1,3,1,3,1,3,3,2,1,2,1,3,2,3,1,3,2,3,1,3,1,4,1,2,1,2,
%T A244964 4,3,1,2,1,4,1,3,1,3,3,2,1,3,2,3,2,3,1,2,2,3,2,2,1,5,1,2,2,2,2,3,1,2,
%U A244964 1,6,1,3,1,2,3,2,3,3,1,4,1,2,1,4,2,2,1,3,1,4,2,3,1,2,2,3,1,3,1,4,1,3,1,3,5
%N A244964 Number of distinct generalized pentagonal numbers dividing n.
%C A244964 For more information about the generalized pentagonal numbers see A001318.
%H A244964 Amiram Eldar, <a href="/A244964/b244964.txt">Table of n, a(n) for n = 1..10000</a>
%F A244964 From _Amiram Eldar_, Dec 31 2023: (Start)
%F A244964 a(n) = Sum_{d|n} A080995(d).
%F A244964 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 6 - 2*Pi/sqrt(3) = 2.372401... . (End)
%e A244964 For n = 10 the generalized pentagonal numbers <= 10 are [0, 1, 2, 5, 7]. There are three generalized pentagonal numbers that divide 10; they are [1, 2, 5], so a(10) = 3.
%t A244964 a[n_] := DivisorSum[n, 1 &, IntegerQ[Sqrt[24*# + 1]] &]; Array[a, 100] (* _Amiram Eldar_, Dec 31 2023 *)
%o A244964 (PARI) a(n) = sumdiv(n, d, issquare(24*d + 1)); \\ _Amiram Eldar_, Dec 31 2023
%Y A244964 Cf. A000005, A001221, A001318, A001511, A005086, A006519, A007862, A027750, A046951, A080995, A147645, A175003, A236103, A238442, A239930.
%K A244964 nonn
%O A244964 1,2
%A A244964 _Omar E. Pol_, Jul 10 2014