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.

A085779 Smallest m such that the triangular number A000217(n) divides m!.

This page as a plain text file.
%I A085779 #14 May 25 2024 06:40:54
%S A085779 1,3,3,5,5,7,7,6,6,11,11,13,13,7,5,17,17,19,19,7,11,23,23,10,13,13,9,
%T A085779 29,29,31,31,11,17,17,7,37,37,19,13,41,41,43,43,11,23,47,47,14,14,17,
%U A085779 17,53,53,11,11,19,29,59,59,61,61,31,8,13,13,67,67,23,23,71,71,73,73,37,19,19
%N A085779 Smallest m such that the triangular number A000217(n) divides m!.
%H A085779 Amiram Eldar, <a href="/A085779/b085779.txt">Table of n, a(n) for n = 1..10000</a>
%F A085779 a(n) = A002034(A000217(n)).
%e A085779 t(4) = 10 and the first factorial divisible by 10 is 5!, so a(4) = 5.
%t A085779 nn=80;With[{f=Range[nn]!,trs=Accumulate[Range[nn]]},Flatten[ Table[ Position[f,_?(Divisible[#,trs[[n]]]&),{1},1],{n,nn}]]] (* _Harvey P. Dale_, Nov 18 2013 *)
%o A085779 (PARI) t(n)=n*(n+1)/2;
%o A085779 for (n=1,50,c=1; while (c!%t(n)!=0,c++); print1(c","));
%Y A085779 Cf. A000217, A002034.
%K A085779 nonn
%O A085779 1,2
%A A085779 _Jon Perry_, Jul 23 2003
%E A085779 Extended by _Ray Chandler_, Jun 06 2008