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.

A277166 Numbers m such that m divides the number of divisors of m!!.

This page as a plain text file.
%I A277166 #15 Aug 27 2020 03:36:44
%S A277166 1,2,4,8,15,16,24,27,32,36,40,48,54,56,60,63,64,72,80,84,90,96,104,
%T A277166 105,108,112,120,128,132,135,140,144,147,152,156,160,164,165,168,180,
%U A277166 189,192,195,200,204,210,216,220,224,225,228,231,240,243,250,252,256
%N A277166 Numbers m such that m divides the number of divisors of m!!.
%C A277166 It seems that a(n) is asymptotic to c*n with c = 4.8...
%H A277166 Amiram Eldar, <a href="/A277166/b277166.txt">Table of n, a(n) for n = 1..10000</a>
%F A277166 A114338(a(n)) mod a(n) = 0.
%e A277166 8 is in the sequence because the number of divisor of 8!! is A114338(8) = 16, which is divisible by 8.
%t A277166 ok[n_] := Divisible[ DivisorSigma[0, n!!], n]; Select[ Range[200], ok]
%o A277166 (PARI) isok(n) = (numdiv(prod(i=0, (n-1)\2, n - 2*i)) % n) == 0; \\ after first Pari in A006882; _Michel Marcus_, Oct 02 2016
%Y A277166 Cf. A000005, A006882, A051178, A114338.
%K A277166 nonn
%O A277166 1,2
%A A277166 _Michel Lagneau_, Oct 01 2016