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.

A233005 a(n) = floor(Pt(n)/n!), where Pt(n) is product of first n positive triangular numbers (A000217).

This page as a plain text file.
%I A233005 #25 Mar 25 2025 15:02:04
%S A233005 1,1,3,7,22,78,315,1417,7087,38981,233887,1520268,10641881,79814109,
%T A233005 638512875,5427359437,48846234937,464039231906,4640392319062,
%U A233005 48724119350156,535965312851718,6163601097794765,73963213173537187,924540164669214843,12019022140699792968
%N A233005 a(n) = floor(Pt(n)/n!), where Pt(n) is product of first n positive triangular numbers (A000217).
%H A233005 Harvey P. Dale, <a href="/A233005/b233005.txt">Table of n, a(n) for n = 1..505</a>
%F A233005 a(n) = floor((n+1)!/2^n). - _Yifan Xie_, Mar 05 2023
%e A233005 a(4) = 7, because, the first four triangular numbers being 1, 3, 6, 10, their product is 180, which divided by 4! is 15/2 = 7.5.
%e A233005 a(5) = 22, because, the first five triangular numbers being 1, 3, 6, 10, 15, their product is 2700, which divided by 5! is 45/2 = 22.5.
%t A233005 With[{nn=30},Floor[#[[1]]/#[[2]]]&/@Thread[{FoldList[Times,Accumulate[ Range[ nn]]],Range[nn]!}]] (* _Harvey P. Dale_, Apr 02 2017 *)
%o A233005 (Python)
%o A233005 f=t=1
%o A233005 for n in range(1,33):
%o A233005   t*=n*(n+1)//2
%o A233005   f*=n
%o A233005   print(t//f, end=', ')
%Y A233005 Cf. A000142, A000217.
%Y A233005 Cf. A006472 (triangular factorial, essentially equal to Pt(n)).
%Y A233005 Cf. A067667 (Pt(n)/n! for n's of the form 2^k-1).
%K A233005 nonn
%O A233005 1,3
%A A233005 _Alex Ratushnyak_, Dec 03 2013