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 A308833 #48 Jun 11 2023 12:19:19
%S A308833 1,7,8,13,14,19,20,23,24,25,26,31,32,33,34,37,38,43,44,47,48,49,50,53,
%T A308833 54,55,56,61,62,63,64,67,68,73,74,75,76,79,80,83,84,85,86,89,90,91,92,
%U A308833 93,94,97,98,103,104,109,110,113,114,115,116,117,118,119,120
%N A308833 Numbers r such that the r-th tetrahedral number A000292(r) divides r!.
%C A308833 Conjecture: for every odd integer r > 1, the following statements are equivalent: a) r is a term of this sequence, b) r + 1 is a term of this sequence, c) r + 2 is composite.
%H A308833 David A. Corneth, <a href="/A308833/b308833.txt">Table of n, a(n) for n = 1..10000</a>
%e A308833 The 7th tetrahedral number is 84, and 84*60 = 5040 = 7!.
%p A308833 q := n -> (irem(n!, n*(n+1)*(n+2)/6) = 0):
%p A308833 select(q, [$1..120])[];
%t A308833 Select[Range@ 120, Mod[#!, Pochhammer[#, 3]/6] == 0 &] (* _Michael De Vlieger_, Jul 08 2019 *)
%o A308833 (PARI) isok(k) = !(k! % (k*(k+1)*(k+2)/6)); \\ _Michel Marcus_, Jun 28 2019
%o A308833 (PARI) is(n) = { my(f = factor(binomial(n + 2, 3))); forstep(i = #f~, 1, -1, if(val(n, f[i, 1]) - f[i, 2] < 0, return(0) ) ); 1 }
%o A308833 val(n, p) = my(r=0); while(n, r+=n\=p);r \\ _David A. Corneth_, Mar 22 2021
%Y A308833 Cf. A000142 (factorial numbers), A000292 (tetrahedral numbers).
%Y A308833 Cf. A007921 (numbers which are not difference of two primes), A153238.
%K A308833 nonn,easy
%O A308833 1,2
%A A308833 _Lorenzo Sauras Altuzarra_, Jun 28 2019